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/float-benchs/divmul_buf_diverge.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:10:35,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:10:35,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:10:35,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:10:35,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:10:35,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:10:35,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:10:35,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:10:35,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:10:35,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:10:35,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:10:35,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:10:35,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:10:35,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:10:35,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:10:35,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:10:35,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:10:35,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:10:35,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:10:35,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:10:35,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:10:35,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:10:35,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:10:35,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:10:35,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:10:35,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:10:35,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:10:35,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:10:35,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:10:35,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:10:35,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:10:35,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:10:35,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:10:35,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:10:35,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:10:35,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:10:35,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:10:35,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:10:35,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:10:35,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:10:35,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:10:35,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 01:10:35,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:10:35,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:10:35,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:10:35,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:10:35,092 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:10:35,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:10:35,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:10:35,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:10:35,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:10:35,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:10:35,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:10:35,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:10:35,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:10:35,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:10:35,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:10:35,095 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:10:35,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:10:35,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:10:35,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:10:35,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:10:35,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:10:35,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:10:35,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:10:35,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:10:35,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:10:35,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:10:35,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:10:35,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:10:35,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:10:35,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:10:35,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:10:35,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:10:35,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:10:35,178 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:10:35,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/divmul_buf_diverge.c [2019-09-08 01:10:35,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767665112/6e9a57e2212b4244990a344af0fd52d7/FLAGa43bbd599 [2019-09-08 01:10:35,777 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:10:35,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/divmul_buf_diverge.c [2019-09-08 01:10:35,786 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767665112/6e9a57e2212b4244990a344af0fd52d7/FLAGa43bbd599 [2019-09-08 01:10:36,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767665112/6e9a57e2212b4244990a344af0fd52d7 [2019-09-08 01:10:36,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:10:36,139 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:10:36,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:36,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:10:36,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:10:36,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:36" (1/1) ... [2019-09-08 01:10:36,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b47492e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36, skipping insertion in model container [2019-09-08 01:10:36,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:36" (1/1) ... [2019-09-08 01:10:36,161 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:10:36,182 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:10:36,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:36,367 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:10:36,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:36,405 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:10:36,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36 WrapperNode [2019-09-08 01:10:36,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:36,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:10:36,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:10:36,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:10:36,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36" (1/1) ... [2019-09-08 01:10:36,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36" (1/1) ... [2019-09-08 01:10:36,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36" (1/1) ... [2019-09-08 01:10:36,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36" (1/1) ... [2019-09-08 01:10:36,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36" (1/1) ... [2019-09-08 01:10:36,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36" (1/1) ... [2019-09-08 01:10:36,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36" (1/1) ... [2019-09-08 01:10:36,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:10:36,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:10:36,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:10:36,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:10:36,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:10:36,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:10:36,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:10:36,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 01:10:36,592 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_clock [2019-09-08 01:10:36,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:10:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:10:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:10:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2019-09-08 01:10:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 01:10:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 01:10:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_clock [2019-09-08 01:10:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:10:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:10:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:10:36,795 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:10:36,796 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 01:10:36,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:36 BoogieIcfgContainer [2019-09-08 01:10:36,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:10:36,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:10:36,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:10:36,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:10:36,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:10:36" (1/3) ... [2019-09-08 01:10:36,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2111af82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:36, skipping insertion in model container [2019-09-08 01:10:36,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36" (2/3) ... [2019-09-08 01:10:36,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2111af82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:36, skipping insertion in model container [2019-09-08 01:10:36,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:36" (3/3) ... [2019-09-08 01:10:36,826 INFO L109 eAbstractionObserver]: Analyzing ICFG divmul_buf_diverge.c [2019-09-08 01:10:36,847 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:10:36,859 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:10:36,883 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:10:36,947 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:10:36,949 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:10:36,949 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:10:36,950 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:10:36,950 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:10:36,950 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:10:36,950 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:10:36,950 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:10:36,951 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:10:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-08 01:10:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:10:36,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:36,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:36,997 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:37,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:37,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1082648863, now seen corresponding path program 1 times [2019-09-08 01:10:37,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:37,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:37,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:37,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:37,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:10:37,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:10:37,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:10:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:10:37,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:10:37,130 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-08 01:10:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:37,153 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-09-08 01:10:37,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:10:37,155 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-08 01:10:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:37,164 INFO L225 Difference]: With dead ends: 36 [2019-09-08 01:10:37,164 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 01:10:37,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:10:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 01:10:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 01:10:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 01:10:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-08 01:10:37,218 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2019-09-08 01:10:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:37,218 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-08 01:10:37,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:10:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-08 01:10:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:10:37,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:37,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:37,220 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:37,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:37,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1069719569, now seen corresponding path program 1 times [2019-09-08 01:10:37,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:37,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:37,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:10:37,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:10:37,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:10:37,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:10:37,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:10:37,280 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2019-09-08 01:10:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:37,340 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-09-08 01:10:37,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:10:37,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-08 01:10:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:37,343 INFO L225 Difference]: With dead ends: 27 [2019-09-08 01:10:37,343 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:10:37,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:10:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:10:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-09-08 01:10:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 01:10:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-08 01:10:37,367 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2019-09-08 01:10:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:37,368 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-08 01:10:37,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:10:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-08 01:10:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 01:10:37,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:37,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:37,373 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:37,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:37,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1770755898, now seen corresponding path program 1 times [2019-09-08 01:10:37,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:37,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:37,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:37,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:37,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:37,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:10:37,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:37,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:37,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-08 01:10:37,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:10:37,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:10:37,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:37,614 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-09-08 01:10:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:37,672 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-09-08 01:10:37,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:10:37,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-08 01:10:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:37,674 INFO L225 Difference]: With dead ends: 32 [2019-09-08 01:10:37,674 INFO L226 Difference]: Without dead ends: 27 [2019-09-08 01:10:37,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-08 01:10:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-09-08 01:10:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:10:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-08 01:10:37,683 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2019-09-08 01:10:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:37,684 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-08 01:10:37,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:10:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-08 01:10:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:10:37,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:37,687 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:37,687 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash 337571825, now seen corresponding path program 2 times [2019-09-08 01:10:37,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:37,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:10:37,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:37,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:37,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:37,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:37,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:37,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:10:37,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:10:37,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:37,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-08 01:10:37,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:10:37,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:10:37,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:10:37,865 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2019-09-08 01:10:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:37,919 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-08 01:10:37,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:10:37,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-08 01:10:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:37,921 INFO L225 Difference]: With dead ends: 37 [2019-09-08 01:10:37,921 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 01:10:37,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:10:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 01:10:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-09-08 01:10:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 01:10:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-09-08 01:10:37,937 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 24 [2019-09-08 01:10:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:37,938 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-09-08 01:10:37,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:10:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-09-08 01:10:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 01:10:37,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:37,940 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:37,940 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1752192166, now seen corresponding path program 3 times [2019-09-08 01:10:37,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:37,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:37,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:10:38,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:38,016 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-08 01:10:38,040 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-08 01:10:38,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 01:10:38,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:38,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:10:38,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 01:10:38,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:38,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 01:10:38,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:10:38,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:10:38,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:38,102 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 6 states. [2019-09-08 01:10:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:38,150 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-08 01:10:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:10:38,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-09-08 01:10:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:38,153 INFO L225 Difference]: With dead ends: 42 [2019-09-08 01:10:38,153 INFO L226 Difference]: Without dead ends: 37 [2019-09-08 01:10:38,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-08 01:10:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-09-08 01:10:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 01:10:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-09-08 01:10:38,162 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2019-09-08 01:10:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:38,163 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-09-08 01:10:38,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:10:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-09-08 01:10:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 01:10:38,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:38,165 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:38,165 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:38,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1833039825, now seen corresponding path program 4 times [2019-09-08 01:10:38,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:38,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:38,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:38,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:38,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:10:38,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:38,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:38,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:38,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:38,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:38,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:10:38,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:10:38,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:38,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 01:10:38,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:10:38,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:10:38,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:38,362 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 7 states. [2019-09-08 01:10:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:38,422 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-09-08 01:10:38,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:10:38,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-09-08 01:10:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:38,426 INFO L225 Difference]: With dead ends: 47 [2019-09-08 01:10:38,426 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 01:10:38,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 01:10:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-09-08 01:10:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-08 01:10:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2019-09-08 01:10:38,444 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 38 [2019-09-08 01:10:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:38,445 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-09-08 01:10:38,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:10:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2019-09-08 01:10:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 01:10:38,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:38,448 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:38,448 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:38,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:38,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1313736570, now seen corresponding path program 5 times [2019-09-08 01:10:38,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:38,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:38,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 01:10:38,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:38,631 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-08 01:10:38,654 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:38,683 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 01:10:38,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:38,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 01:10:38,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:38,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:38,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-08 01:10:38,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:10:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:10:38,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:38,710 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 8 states. [2019-09-08 01:10:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:38,765 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2019-09-08 01:10:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:10:38,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-09-08 01:10:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:38,767 INFO L225 Difference]: With dead ends: 52 [2019-09-08 01:10:38,767 INFO L226 Difference]: Without dead ends: 47 [2019-09-08 01:10:38,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-08 01:10:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-09-08 01:10:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 01:10:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-09-08 01:10:38,775 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 45 [2019-09-08 01:10:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:38,776 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-09-08 01:10:38,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:10:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2019-09-08 01:10:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 01:10:38,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:38,778 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:38,778 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:38,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash 755611569, now seen corresponding path program 6 times [2019-09-08 01:10:38,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:38,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:38,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 01:10:38,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:38,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:38,927 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:38,963 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 01:10:38,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:38,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:10:38,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:38,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:38,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 01:10:38,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:10:38,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:10:38,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:38,989 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 9 states. [2019-09-08 01:10:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:39,071 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2019-09-08 01:10:39,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:10:39,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-08 01:10:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:39,074 INFO L225 Difference]: With dead ends: 57 [2019-09-08 01:10:39,074 INFO L226 Difference]: Without dead ends: 52 [2019-09-08 01:10:39,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-08 01:10:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2019-09-08 01:10:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 01:10:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-09-08 01:10:39,085 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 52 [2019-09-08 01:10:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:39,085 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-09-08 01:10:39,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:10:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2019-09-08 01:10:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 01:10:39,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:39,087 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:39,087 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:39,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1982376858, now seen corresponding path program 7 times [2019-09-08 01:10:39,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:39,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:39,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 01:10:39,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:39,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:39,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:39,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:10:39,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 01:10:39,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:39,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-08 01:10:39,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:10:39,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:10:39,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:10:39,312 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 10 states. [2019-09-08 01:10:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:39,418 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2019-09-08 01:10:39,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:10:39,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-09-08 01:10:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:39,424 INFO L225 Difference]: With dead ends: 62 [2019-09-08 01:10:39,425 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 01:10:39,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:10:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 01:10:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-09-08 01:10:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 01:10:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2019-09-08 01:10:39,441 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 59 [2019-09-08 01:10:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:39,442 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2019-09-08 01:10:39,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:10:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2019-09-08 01:10:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 01:10:39,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:39,446 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:39,447 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:39,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1730924655, now seen corresponding path program 8 times [2019-09-08 01:10:39,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:39,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:39,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:39,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:39,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 01:10:39,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:39,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:39,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:39,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:39,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:39,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:10:39,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 01:10:39,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:39,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 01:10:39,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:10:39,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:10:39,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:10:39,726 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand 11 states. [2019-09-08 01:10:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:39,808 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-09-08 01:10:39,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:10:39,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-09-08 01:10:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:39,810 INFO L225 Difference]: With dead ends: 67 [2019-09-08 01:10:39,810 INFO L226 Difference]: Without dead ends: 62 [2019-09-08 01:10:39,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:10:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-08 01:10:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2019-09-08 01:10:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 01:10:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2019-09-08 01:10:39,834 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 66 [2019-09-08 01:10:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:39,835 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2019-09-08 01:10:39,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:10:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2019-09-08 01:10:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 01:10:39,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:39,840 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:39,840 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:39,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1543399494, now seen corresponding path program 9 times [2019-09-08 01:10:39,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:39,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:39,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 01:10:39,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:39,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:39,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:40,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 01:10:40,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:40,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:10:40,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:40,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:40,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-08 01:10:40,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:10:40,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:10:40,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:10:40,078 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand 12 states. [2019-09-08 01:10:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:40,173 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2019-09-08 01:10:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:10:40,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 01:10:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:40,175 INFO L225 Difference]: With dead ends: 72 [2019-09-08 01:10:40,175 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 01:10:40,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:10:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 01:10:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-09-08 01:10:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 01:10:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2019-09-08 01:10:40,185 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 73 [2019-09-08 01:10:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:40,186 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2019-09-08 01:10:40,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:10:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2019-09-08 01:10:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 01:10:40,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:40,188 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:40,188 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:40,189 INFO L82 PathProgramCache]: Analyzing trace with hash 964648817, now seen corresponding path program 10 times [2019-09-08 01:10:40,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:40,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:40,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:40,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 01:10:40,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:40,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:40,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:40,425 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:40,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:40,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 01:10:40,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 01:10:40,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:40,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-08 01:10:40,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:10:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:10:40,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:10:40,495 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 13 states. [2019-09-08 01:10:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:40,661 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2019-09-08 01:10:40,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:10:40,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-09-08 01:10:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:40,663 INFO L225 Difference]: With dead ends: 77 [2019-09-08 01:10:40,664 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 01:10:40,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:10:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 01:10:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-09-08 01:10:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-08 01:10:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2019-09-08 01:10:40,684 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 80 [2019-09-08 01:10:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:40,685 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2019-09-08 01:10:40,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:10:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2019-09-08 01:10:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 01:10:40,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:40,687 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:40,687 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash 960154586, now seen corresponding path program 11 times [2019-09-08 01:10:40,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:40,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:40,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:40,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 01:10:40,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:40,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:40,942 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 01:10:40,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:40,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:10:40,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 01:10:40,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:40,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-08 01:10:40,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:10:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:10:40,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:10:40,992 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand 14 states. [2019-09-08 01:10:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:41,101 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2019-09-08 01:10:41,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 01:10:41,102 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2019-09-08 01:10:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:41,103 INFO L225 Difference]: With dead ends: 82 [2019-09-08 01:10:41,103 INFO L226 Difference]: Without dead ends: 77 [2019-09-08 01:10:41,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:10:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-08 01:10:41,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2019-09-08 01:10:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-08 01:10:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2019-09-08 01:10:41,112 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 87 [2019-09-08 01:10:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:41,112 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2019-09-08 01:10:41,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:10:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2019-09-08 01:10:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 01:10:41,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:41,114 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:41,114 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:41,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1150728367, now seen corresponding path program 12 times [2019-09-08 01:10:41,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:41,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:41,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:41,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 01:10:41,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:41,267 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) [2019-09-08 01:10:41,285 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:41,338 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 01:10:41,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:41,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 01:10:41,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 01:10:41,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:41,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-08 01:10:41,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 01:10:41,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 01:10:41,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:10:41,392 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand 15 states. [2019-09-08 01:10:41,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:41,524 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2019-09-08 01:10:41,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 01:10:41,525 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2019-09-08 01:10:41,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:41,526 INFO L225 Difference]: With dead ends: 87 [2019-09-08 01:10:41,526 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 01:10:41,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:10:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 01:10:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-09-08 01:10:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-08 01:10:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2019-09-08 01:10:41,534 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 94 [2019-09-08 01:10:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:41,535 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2019-09-08 01:10:41,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 01:10:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2019-09-08 01:10:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 01:10:41,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:41,537 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:41,537 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2085206022, now seen corresponding path program 13 times [2019-09-08 01:10:41,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:41,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:41,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:41,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-09-08 01:10:41,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:41,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:41,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:41,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 01:10:41,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-09-08 01:10:41,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:41,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-08 01:10:41,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 01:10:41,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 01:10:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:10:41,831 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand 16 states. [2019-09-08 01:10:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:41,961 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2019-09-08 01:10:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 01:10:41,962 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 101 [2019-09-08 01:10:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:41,963 INFO L225 Difference]: With dead ends: 92 [2019-09-08 01:10:41,964 INFO L226 Difference]: Without dead ends: 87 [2019-09-08 01:10:41,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:10:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-08 01:10:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-09-08 01:10:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-08 01:10:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2019-09-08 01:10:41,971 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 101 [2019-09-08 01:10:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:41,971 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2019-09-08 01:10:41,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 01:10:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2019-09-08 01:10:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 01:10:41,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:41,973 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:41,973 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:41,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:41,974 INFO L82 PathProgramCache]: Analyzing trace with hash -831527119, now seen corresponding path program 14 times [2019-09-08 01:10:41,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:41,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:41,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:41,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-08 01:10:42,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:42,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:42,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:42,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:42,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:42,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 01:10:42,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-08 01:10:42,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:42,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-08 01:10:42,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 01:10:42,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 01:10:42,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:10:42,270 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand 17 states. [2019-09-08 01:10:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:42,406 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2019-09-08 01:10:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 01:10:42,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 108 [2019-09-08 01:10:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:42,408 INFO L225 Difference]: With dead ends: 97 [2019-09-08 01:10:42,408 INFO L226 Difference]: Without dead ends: 92 [2019-09-08 01:10:42,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:10:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-08 01:10:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-09-08 01:10:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-08 01:10:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2019-09-08 01:10:42,420 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 108 [2019-09-08 01:10:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:42,421 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2019-09-08 01:10:42,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 01:10:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2019-09-08 01:10:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 01:10:42,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:42,424 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:42,424 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:42,425 INFO L82 PathProgramCache]: Analyzing trace with hash -573174758, now seen corresponding path program 15 times [2019-09-08 01:10:42,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:42,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:42,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 01:10:42,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:42,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:42,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:42,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-08 01:10:42,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:42,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 01:10:42,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 01:10:42,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:42,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-08 01:10:42,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 01:10:42,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 01:10:42,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:10:42,780 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand 18 states. [2019-09-08 01:10:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:42,937 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2019-09-08 01:10:42,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 01:10:42,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2019-09-08 01:10:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:42,939 INFO L225 Difference]: With dead ends: 102 [2019-09-08 01:10:42,939 INFO L226 Difference]: Without dead ends: 97 [2019-09-08 01:10:42,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:10:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-08 01:10:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-09-08 01:10:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-08 01:10:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-09-08 01:10:42,946 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 115 [2019-09-08 01:10:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:42,947 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-09-08 01:10:42,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 01:10:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-09-08 01:10:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 01:10:42,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:42,949 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:42,949 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash 99696401, now seen corresponding path program 16 times [2019-09-08 01:10:42,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:42,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:42,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:42,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:42,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-08 01:10:43,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:43,168 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-08 01:10:43,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:43,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:43,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:43,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 01:10:43,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:43,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:43,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-08 01:10:43,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 01:10:43,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 01:10:43,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:10:43,292 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 19 states. [2019-09-08 01:10:43,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:43,478 INFO L93 Difference]: Finished difference Result 107 states and 142 transitions. [2019-09-08 01:10:43,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 01:10:43,481 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 122 [2019-09-08 01:10:43,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:43,483 INFO L225 Difference]: With dead ends: 107 [2019-09-08 01:10:43,484 INFO L226 Difference]: Without dead ends: 102 [2019-09-08 01:10:43,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:10:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-08 01:10:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2019-09-08 01:10:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-08 01:10:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 131 transitions. [2019-09-08 01:10:43,490 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 131 transitions. Word has length 122 [2019-09-08 01:10:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:43,491 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 131 transitions. [2019-09-08 01:10:43,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 01:10:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 131 transitions. [2019-09-08 01:10:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 01:10:43,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:43,493 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:43,493 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash -830728134, now seen corresponding path program 17 times [2019-09-08 01:10:43,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:43,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:43,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:43,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:43,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-08 01:10:43,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:43,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:43,745 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:43,822 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-08 01:10:43,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:43,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 01:10:43,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-08 01:10:43,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:43,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-08 01:10:43,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 01:10:43,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 01:10:43,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:10:43,869 INFO L87 Difference]: Start difference. First operand 98 states and 131 transitions. Second operand 20 states. [2019-09-08 01:10:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:44,028 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2019-09-08 01:10:44,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:10:44,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 129 [2019-09-08 01:10:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:44,031 INFO L225 Difference]: With dead ends: 112 [2019-09-08 01:10:44,031 INFO L226 Difference]: Without dead ends: 107 [2019-09-08 01:10:44,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:10:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-08 01:10:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-09-08 01:10:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-08 01:10:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 138 transitions. [2019-09-08 01:10:44,038 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 138 transitions. Word has length 129 [2019-09-08 01:10:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:44,039 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 138 transitions. [2019-09-08 01:10:44,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 01:10:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 138 transitions. [2019-09-08 01:10:44,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 01:10:44,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:44,041 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:44,042 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:44,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:44,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1194635535, now seen corresponding path program 18 times [2019-09-08 01:10:44,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:44,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:44,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:44,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-08 01:10:44,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:44,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:44,400 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:44,484 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 01:10:44,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:44,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 01:10:44,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-08 01:10:44,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:44,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-08 01:10:44,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 01:10:44,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 01:10:44,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:10:44,542 INFO L87 Difference]: Start difference. First operand 103 states and 138 transitions. Second operand 21 states. [2019-09-08 01:10:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:44,706 INFO L93 Difference]: Finished difference Result 117 states and 156 transitions. [2019-09-08 01:10:44,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:10:44,707 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 136 [2019-09-08 01:10:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:44,708 INFO L225 Difference]: With dead ends: 117 [2019-09-08 01:10:44,708 INFO L226 Difference]: Without dead ends: 112 [2019-09-08 01:10:44,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:10:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-08 01:10:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-09-08 01:10:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-08 01:10:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2019-09-08 01:10:44,720 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 136 [2019-09-08 01:10:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:44,721 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2019-09-08 01:10:44,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 01:10:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2019-09-08 01:10:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 01:10:44,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:44,726 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:44,726 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:44,727 INFO L82 PathProgramCache]: Analyzing trace with hash 688548954, now seen corresponding path program 19 times [2019-09-08 01:10:44,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:44,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:44,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:44,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-08 01:10:45,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:45,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:45,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 01:10:45,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-08 01:10:45,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:45,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-08 01:10:45,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 01:10:45,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 01:10:45,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:10:45,190 INFO L87 Difference]: Start difference. First operand 108 states and 145 transitions. Second operand 22 states. [2019-09-08 01:10:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:45,402 INFO L93 Difference]: Finished difference Result 122 states and 163 transitions. [2019-09-08 01:10:45,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 01:10:45,402 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 143 [2019-09-08 01:10:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:45,404 INFO L225 Difference]: With dead ends: 122 [2019-09-08 01:10:45,404 INFO L226 Difference]: Without dead ends: 117 [2019-09-08 01:10:45,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:10:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-08 01:10:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-09-08 01:10:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-08 01:10:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2019-09-08 01:10:45,411 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 143 [2019-09-08 01:10:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:45,412 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2019-09-08 01:10:45,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 01:10:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2019-09-08 01:10:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 01:10:45,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:45,414 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:45,414 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:45,414 INFO L82 PathProgramCache]: Analyzing trace with hash -514058543, now seen corresponding path program 20 times [2019-09-08 01:10:45,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:45,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-08 01:10:45,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:45,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:45,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:45,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:45,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:45,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 01:10:45,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-08 01:10:45,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:45,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-08 01:10:45,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 01:10:45,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 01:10:45,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:10:45,824 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand 23 states. [2019-09-08 01:10:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:46,034 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2019-09-08 01:10:46,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 01:10:46,037 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 150 [2019-09-08 01:10:46,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:46,039 INFO L225 Difference]: With dead ends: 127 [2019-09-08 01:10:46,040 INFO L226 Difference]: Without dead ends: 122 [2019-09-08 01:10:46,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:10:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-08 01:10:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-09-08 01:10:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-08 01:10:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 159 transitions. [2019-09-08 01:10:46,049 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 159 transitions. Word has length 150 [2019-09-08 01:10:46,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:46,051 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 159 transitions. [2019-09-08 01:10:46,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 01:10:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 159 transitions. [2019-09-08 01:10:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 01:10:46,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:46,053 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:46,053 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:46,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash 761464954, now seen corresponding path program 21 times [2019-09-08 01:10:46,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:46,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:46,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-08 01:10:46,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:46,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:46,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:46,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-08 01:10:46,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:46,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 01:10:46,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:46,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:46,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-08 01:10:46,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 01:10:46,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 01:10:46,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:10:46,550 INFO L87 Difference]: Start difference. First operand 118 states and 159 transitions. Second operand 24 states. [2019-09-08 01:10:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:46,783 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2019-09-08 01:10:46,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 01:10:46,783 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 157 [2019-09-08 01:10:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:46,785 INFO L225 Difference]: With dead ends: 132 [2019-09-08 01:10:46,785 INFO L226 Difference]: Without dead ends: 127 [2019-09-08 01:10:46,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:10:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-08 01:10:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-09-08 01:10:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-08 01:10:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 166 transitions. [2019-09-08 01:10:46,793 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 166 transitions. Word has length 157 [2019-09-08 01:10:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:46,793 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 166 transitions. [2019-09-08 01:10:46,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 01:10:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 166 transitions. [2019-09-08 01:10:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 01:10:46,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:46,795 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:46,795 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:46,796 INFO L82 PathProgramCache]: Analyzing trace with hash -41838927, now seen corresponding path program 22 times [2019-09-08 01:10:46,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:46,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:46,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:46,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:46,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-08 01:10:47,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:47,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:47,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:47,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:47,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:47,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 01:10:47,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-08 01:10:47,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:47,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-08 01:10:47,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 01:10:47,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 01:10:47,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 01:10:47,218 INFO L87 Difference]: Start difference. First operand 123 states and 166 transitions. Second operand 25 states. [2019-09-08 01:10:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:47,379 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2019-09-08 01:10:47,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 01:10:47,380 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 164 [2019-09-08 01:10:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:47,381 INFO L225 Difference]: With dead ends: 137 [2019-09-08 01:10:47,382 INFO L226 Difference]: Without dead ends: 132 [2019-09-08 01:10:47,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 01:10:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-08 01:10:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2019-09-08 01:10:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-08 01:10:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 173 transitions. [2019-09-08 01:10:47,390 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 173 transitions. Word has length 164 [2019-09-08 01:10:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:47,391 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 173 transitions. [2019-09-08 01:10:47,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 01:10:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 173 transitions. [2019-09-08 01:10:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 01:10:47,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:47,392 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:47,393 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:47,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:47,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1477972838, now seen corresponding path program 23 times [2019-09-08 01:10:47,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:47,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:47,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-08 01:10:47,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:47,842 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-08 01:10:47,864 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:47,969 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-08 01:10:47,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:47,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 01:10:47,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-08 01:10:48,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:48,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-08 01:10:48,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 01:10:48,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 01:10:48,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:10:48,036 INFO L87 Difference]: Start difference. First operand 128 states and 173 transitions. Second operand 26 states. [2019-09-08 01:10:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:48,234 INFO L93 Difference]: Finished difference Result 142 states and 191 transitions. [2019-09-08 01:10:48,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 01:10:48,235 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 171 [2019-09-08 01:10:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:48,236 INFO L225 Difference]: With dead ends: 142 [2019-09-08 01:10:48,236 INFO L226 Difference]: Without dead ends: 137 [2019-09-08 01:10:48,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:10:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-08 01:10:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2019-09-08 01:10:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-08 01:10:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 180 transitions. [2019-09-08 01:10:48,245 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 180 transitions. Word has length 171 [2019-09-08 01:10:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:48,245 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 180 transitions. [2019-09-08 01:10:48,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 01:10:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 180 transitions. [2019-09-08 01:10:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 01:10:48,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:48,248 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:48,248 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash -291909999, now seen corresponding path program 24 times [2019-09-08 01:10:48,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:48,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:48,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-08 01:10:48,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:48,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:48,726 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:48,803 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-08 01:10:48,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:48,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 01:10:48,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-08 01:10:48,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:48,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-08 01:10:48,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 01:10:48,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 01:10:48,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:10:48,849 INFO L87 Difference]: Start difference. First operand 133 states and 180 transitions. Second operand 27 states. [2019-09-08 01:10:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:49,123 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2019-09-08 01:10:49,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 01:10:49,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 178 [2019-09-08 01:10:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:49,126 INFO L225 Difference]: With dead ends: 147 [2019-09-08 01:10:49,126 INFO L226 Difference]: Without dead ends: 142 [2019-09-08 01:10:49,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:10:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-08 01:10:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-09-08 01:10:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-08 01:10:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 187 transitions. [2019-09-08 01:10:49,133 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 187 transitions. Word has length 178 [2019-09-08 01:10:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:49,134 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 187 transitions. [2019-09-08 01:10:49,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 01:10:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 187 transitions. [2019-09-08 01:10:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 01:10:49,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:49,136 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:49,136 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash 293279930, now seen corresponding path program 25 times [2019-09-08 01:10:49,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:49,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:49,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:49,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:49,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-08 01:10:49,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:49,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:49,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:49,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 01:10:49,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-08 01:10:49,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:49,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-08 01:10:49,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 01:10:49,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 01:10:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:10:49,703 INFO L87 Difference]: Start difference. First operand 138 states and 187 transitions. Second operand 28 states. [2019-09-08 01:10:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:50,032 INFO L93 Difference]: Finished difference Result 152 states and 205 transitions. [2019-09-08 01:10:50,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 01:10:50,033 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 185 [2019-09-08 01:10:50,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:50,034 INFO L225 Difference]: With dead ends: 152 [2019-09-08 01:10:50,034 INFO L226 Difference]: Without dead ends: 147 [2019-09-08 01:10:50,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:10:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-08 01:10:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-09-08 01:10:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-08 01:10:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 194 transitions. [2019-09-08 01:10:50,042 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 194 transitions. Word has length 185 [2019-09-08 01:10:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:50,043 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 194 transitions. [2019-09-08 01:10:50,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 01:10:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 194 transitions. [2019-09-08 01:10:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 01:10:50,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:50,045 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:50,045 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:50,045 INFO L82 PathProgramCache]: Analyzing trace with hash -645742991, now seen corresponding path program 26 times [2019-09-08 01:10:50,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:50,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:50,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:50,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-08 01:10:50,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:50,454 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:50,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:50,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:50,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:50,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 01:10:50,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-08 01:10:50,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:50,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-08 01:10:50,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 01:10:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 01:10:50,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:10:50,612 INFO L87 Difference]: Start difference. First operand 143 states and 194 transitions. Second operand 29 states. [2019-09-08 01:10:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:50,846 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2019-09-08 01:10:50,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 01:10:50,847 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 192 [2019-09-08 01:10:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:50,849 INFO L225 Difference]: With dead ends: 157 [2019-09-08 01:10:50,849 INFO L226 Difference]: Without dead ends: 152 [2019-09-08 01:10:50,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:10:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-08 01:10:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2019-09-08 01:10:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-08 01:10:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 201 transitions. [2019-09-08 01:10:50,856 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 201 transitions. Word has length 192 [2019-09-08 01:10:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:50,856 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 201 transitions. [2019-09-08 01:10:50,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 01:10:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 201 transitions. [2019-09-08 01:10:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 01:10:50,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:50,858 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:50,858 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:50,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1350660902, now seen corresponding path program 27 times [2019-09-08 01:10:50,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:50,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:50,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:50,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2484 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-08 01:10:51,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:51,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:51,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:51,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-08 01:10:51,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:51,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 01:10:51,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2484 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-08 01:10:51,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:51,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-08 01:10:51,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 01:10:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 01:10:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:10:51,775 INFO L87 Difference]: Start difference. First operand 148 states and 201 transitions. Second operand 30 states. [2019-09-08 01:10:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:52,150 INFO L93 Difference]: Finished difference Result 162 states and 219 transitions. [2019-09-08 01:10:52,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 01:10:52,151 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 199 [2019-09-08 01:10:52,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:52,153 INFO L225 Difference]: With dead ends: 162 [2019-09-08 01:10:52,153 INFO L226 Difference]: Without dead ends: 157 [2019-09-08 01:10:52,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:10:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-08 01:10:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-09-08 01:10:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-08 01:10:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 208 transitions. [2019-09-08 01:10:52,165 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 208 transitions. Word has length 199 [2019-09-08 01:10:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:52,166 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 208 transitions. [2019-09-08 01:10:52,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 01:10:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 208 transitions. [2019-09-08 01:10:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 01:10:52,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:52,168 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:52,169 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash 110782033, now seen corresponding path program 28 times [2019-09-08 01:10:52,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:52,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:52,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:52,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:52,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2674 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-09-08 01:10:52,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:52,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:52,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:52,736 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:52,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:52,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 01:10:52,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2674 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:52,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:52,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-08 01:10:52,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 01:10:52,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 01:10:52,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 01:10:52,820 INFO L87 Difference]: Start difference. First operand 153 states and 208 transitions. Second operand 31 states. [2019-09-08 01:10:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:53,126 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions. [2019-09-08 01:10:53,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 01:10:53,127 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 206 [2019-09-08 01:10:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:53,129 INFO L225 Difference]: With dead ends: 167 [2019-09-08 01:10:53,129 INFO L226 Difference]: Without dead ends: 162 [2019-09-08 01:10:53,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 01:10:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-08 01:10:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2019-09-08 01:10:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-08 01:10:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 215 transitions. [2019-09-08 01:10:53,136 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 215 transitions. Word has length 206 [2019-09-08 01:10:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:53,137 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 215 transitions. [2019-09-08 01:10:53,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 01:10:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 215 transitions. [2019-09-08 01:10:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 01:10:53,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:53,139 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:53,139 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:53,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1277933318, now seen corresponding path program 29 times [2019-09-08 01:10:53,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:53,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:53,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:53,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-08 01:10:53,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:53,700 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-08 01:10:53,712 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:53,852 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-08 01:10:53,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:53,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 01:10:53,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-08 01:10:53,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:53,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-08 01:10:53,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 01:10:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 01:10:53,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:10:53,950 INFO L87 Difference]: Start difference. First operand 158 states and 215 transitions. Second operand 32 states. [2019-09-08 01:10:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:54,390 INFO L93 Difference]: Finished difference Result 172 states and 233 transitions. [2019-09-08 01:10:54,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 01:10:54,391 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 213 [2019-09-08 01:10:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:54,393 INFO L225 Difference]: With dead ends: 172 [2019-09-08 01:10:54,393 INFO L226 Difference]: Without dead ends: 167 [2019-09-08 01:10:54,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:10:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-08 01:10:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2019-09-08 01:10:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-08 01:10:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 222 transitions. [2019-09-08 01:10:54,401 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 222 transitions. Word has length 213 [2019-09-08 01:10:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:54,402 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 222 transitions. [2019-09-08 01:10:54,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 01:10:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 222 transitions. [2019-09-08 01:10:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 01:10:54,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:54,404 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:54,404 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:54,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:54,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1044462031, now seen corresponding path program 30 times [2019-09-08 01:10:54,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:54,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:54,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:54,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:54,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-08 01:10:54,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:54,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:54,900 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:55,031 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-08 01:10:55,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:55,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 01:10:55,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-08 01:10:55,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:55,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-08 01:10:55,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 01:10:55,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 01:10:55,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:10:55,099 INFO L87 Difference]: Start difference. First operand 163 states and 222 transitions. Second operand 33 states. [2019-09-08 01:10:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:55,383 INFO L93 Difference]: Finished difference Result 177 states and 240 transitions. [2019-09-08 01:10:55,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 01:10:55,384 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 220 [2019-09-08 01:10:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:55,386 INFO L225 Difference]: With dead ends: 177 [2019-09-08 01:10:55,386 INFO L226 Difference]: Without dead ends: 172 [2019-09-08 01:10:55,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:10:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-08 01:10:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2019-09-08 01:10:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-08 01:10:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 229 transitions. [2019-09-08 01:10:55,393 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 229 transitions. Word has length 220 [2019-09-08 01:10:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:55,394 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 229 transitions. [2019-09-08 01:10:55,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 01:10:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 229 transitions. [2019-09-08 01:10:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 01:10:55,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:55,396 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:55,396 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1558072602, now seen corresponding path program 31 times [2019-09-08 01:10:55,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:55,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:55,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:55,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3286 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-09-08 01:10:56,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:56,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:56,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:56,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 01:10:56,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3286 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-09-08 01:10:56,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:56,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-08 01:10:56,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 01:10:56,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 01:10:56,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:10:56,303 INFO L87 Difference]: Start difference. First operand 168 states and 229 transitions. Second operand 34 states. [2019-09-08 01:10:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:56,779 INFO L93 Difference]: Finished difference Result 182 states and 247 transitions. [2019-09-08 01:10:56,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 01:10:56,779 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 227 [2019-09-08 01:10:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:56,781 INFO L225 Difference]: With dead ends: 182 [2019-09-08 01:10:56,781 INFO L226 Difference]: Without dead ends: 177 [2019-09-08 01:10:56,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:10:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-08 01:10:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2019-09-08 01:10:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-08 01:10:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 236 transitions. [2019-09-08 01:10:56,790 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 236 transitions. Word has length 227 [2019-09-08 01:10:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:56,790 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 236 transitions. [2019-09-08 01:10:56,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 01:10:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2019-09-08 01:10:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 01:10:56,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:56,792 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:56,792 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:56,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:56,793 INFO L82 PathProgramCache]: Analyzing trace with hash 978181649, now seen corresponding path program 32 times [2019-09-08 01:10:56,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:56,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:56,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:56,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:56,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3504 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-08 01:10:57,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:57,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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:57,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:57,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:57,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:57,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 01:10:57,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3504 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:57,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:57,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-08 01:10:57,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 01:10:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 01:10:57,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:10:57,503 INFO L87 Difference]: Start difference. First operand 173 states and 236 transitions. Second operand 35 states. [2019-09-08 01:10:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:57,987 INFO L93 Difference]: Finished difference Result 187 states and 254 transitions. [2019-09-08 01:10:57,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 01:10:57,988 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 234 [2019-09-08 01:10:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:57,990 INFO L225 Difference]: With dead ends: 187 [2019-09-08 01:10:57,990 INFO L226 Difference]: Without dead ends: 182 [2019-09-08 01:10:57,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:10:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-08 01:10:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2019-09-08 01:10:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-08 01:10:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 243 transitions. [2019-09-08 01:10:57,999 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 243 transitions. Word has length 234 [2019-09-08 01:10:57,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:57,999 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 243 transitions. [2019-09-08 01:10:57,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 01:10:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 243 transitions. [2019-09-08 01:10:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 01:10:58,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:58,002 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:58,002 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash 360618298, now seen corresponding path program 33 times [2019-09-08 01:10:58,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:58,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:58,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:58,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:58,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3729 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-09-08 01:10:58,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:58,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:58,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:58,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-08 01:10:58,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:58,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 01:10:58,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3729 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:59,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:59,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-08 01:10:59,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 01:10:59,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 01:10:59,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:10:59,008 INFO L87 Difference]: Start difference. First operand 178 states and 243 transitions. Second operand 36 states. [2019-09-08 01:10:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:59,297 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2019-09-08 01:10:59,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 01:10:59,298 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 241 [2019-09-08 01:10:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:59,300 INFO L225 Difference]: With dead ends: 192 [2019-09-08 01:10:59,300 INFO L226 Difference]: Without dead ends: 187 [2019-09-08 01:10:59,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:10:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-08 01:10:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2019-09-08 01:10:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-08 01:10:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 250 transitions. [2019-09-08 01:10:59,308 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 250 transitions. Word has length 241 [2019-09-08 01:10:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:59,309 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 250 transitions. [2019-09-08 01:10:59,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 01:10:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2019-09-08 01:10:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 01:10:59,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:59,311 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:59,313 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1663413745, now seen corresponding path program 34 times [2019-09-08 01:10:59,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:59,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:59,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:59,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2019-09-08 01:11:00,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:00,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:00,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:00,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:00,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:00,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 01:11:00,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:00,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:00,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-08 01:11:00,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 01:11:00,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 01:11:00,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:11:00,251 INFO L87 Difference]: Start difference. First operand 183 states and 250 transitions. Second operand 37 states. [2019-09-08 01:11:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:00,646 INFO L93 Difference]: Finished difference Result 197 states and 268 transitions. [2019-09-08 01:11:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 01:11:00,646 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 248 [2019-09-08 01:11:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:00,649 INFO L225 Difference]: With dead ends: 197 [2019-09-08 01:11:00,649 INFO L226 Difference]: Without dead ends: 192 [2019-09-08 01:11:00,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:11:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-08 01:11:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2019-09-08 01:11:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-08 01:11:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 257 transitions. [2019-09-08 01:11:00,677 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 257 transitions. Word has length 248 [2019-09-08 01:11:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:00,677 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 257 transitions. [2019-09-08 01:11:00,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 01:11:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 257 transitions. [2019-09-08 01:11:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 01:11:00,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:00,679 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:00,679 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1793643174, now seen corresponding path program 35 times [2019-09-08 01:11:00,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:00,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:00,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:00,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:00,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-08 01:11:01,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:01,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:01,376 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:01,491 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-08 01:11:01,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:01,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 01:11:01,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-08 01:11:01,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:01,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-08 01:11:01,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 01:11:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 01:11:01,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 01:11:01,580 INFO L87 Difference]: Start difference. First operand 188 states and 257 transitions. Second operand 38 states. [2019-09-08 01:11:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:02,112 INFO L93 Difference]: Finished difference Result 202 states and 275 transitions. [2019-09-08 01:11:02,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 01:11:02,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 255 [2019-09-08 01:11:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:02,114 INFO L225 Difference]: With dead ends: 202 [2019-09-08 01:11:02,115 INFO L226 Difference]: Without dead ends: 197 [2019-09-08 01:11:02,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 01:11:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-08 01:11:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2019-09-08 01:11:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-08 01:11:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-09-08 01:11:02,123 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 255 [2019-09-08 01:11:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:02,126 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-09-08 01:11:02,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 01:11:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-09-08 01:11:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 01:11:02,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:02,129 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:02,130 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:02,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:02,130 INFO L82 PathProgramCache]: Analyzing trace with hash -760990255, now seen corresponding path program 36 times [2019-09-08 01:11:02,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:02,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:02,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:02,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:02,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4446 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2019-09-08 01:11:02,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:02,860 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-08 01:11:02,899 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:03,063 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-08 01:11:03,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:03,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 01:11:03,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4446 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2019-09-08 01:11:03,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:03,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-08 01:11:03,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 01:11:03,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 01:11:03,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:11:03,176 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 39 states. [2019-09-08 01:11:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:03,594 INFO L93 Difference]: Finished difference Result 207 states and 282 transitions. [2019-09-08 01:11:03,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 01:11:03,594 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 262 [2019-09-08 01:11:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:03,596 INFO L225 Difference]: With dead ends: 207 [2019-09-08 01:11:03,597 INFO L226 Difference]: Without dead ends: 202 [2019-09-08 01:11:03,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:11:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-08 01:11:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2019-09-08 01:11:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-08 01:11:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 271 transitions. [2019-09-08 01:11:03,615 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 271 transitions. Word has length 262 [2019-09-08 01:11:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:03,616 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 271 transitions. [2019-09-08 01:11:03,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 01:11:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 271 transitions. [2019-09-08 01:11:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 01:11:03,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:03,619 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:03,620 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:03,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:03,620 INFO L82 PathProgramCache]: Analyzing trace with hash -7730822, now seen corresponding path program 37 times [2019-09-08 01:11:03,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:03,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:03,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:03,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:03,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4699 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2019-09-08 01:11:04,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:04,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:04,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:04,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 01:11:04,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4699 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:04,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:04,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-08 01:11:04,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 01:11:04,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 01:11:04,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:11:04,862 INFO L87 Difference]: Start difference. First operand 198 states and 271 transitions. Second operand 40 states. [2019-09-08 01:11:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:05,356 INFO L93 Difference]: Finished difference Result 212 states and 289 transitions. [2019-09-08 01:11:05,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 01:11:05,357 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 269 [2019-09-08 01:11:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:05,359 INFO L225 Difference]: With dead ends: 212 [2019-09-08 01:11:05,359 INFO L226 Difference]: Without dead ends: 207 [2019-09-08 01:11:05,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:11:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-08 01:11:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-09-08 01:11:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-08 01:11:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 278 transitions. [2019-09-08 01:11:05,368 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 278 transitions. Word has length 269 [2019-09-08 01:11:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:05,369 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 278 transitions. [2019-09-08 01:11:05,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 01:11:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 278 transitions. [2019-09-08 01:11:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 01:11:05,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:05,372 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:05,372 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:05,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:05,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1566083663, now seen corresponding path program 38 times [2019-09-08 01:11:05,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:05,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:05,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:05,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:05,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-08 01:11:06,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:06,352 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) [2019-09-08 01:11:06,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:06,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:06,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:06,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 01:11:06,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:06,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:06,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-08 01:11:06,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 01:11:06,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 01:11:06,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:11:06,572 INFO L87 Difference]: Start difference. First operand 203 states and 278 transitions. Second operand 41 states. [2019-09-08 01:11:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:06,987 INFO L93 Difference]: Finished difference Result 217 states and 296 transitions. [2019-09-08 01:11:06,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 01:11:06,988 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 276 [2019-09-08 01:11:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:06,990 INFO L225 Difference]: With dead ends: 217 [2019-09-08 01:11:06,990 INFO L226 Difference]: Without dead ends: 212 [2019-09-08 01:11:06,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:11:06,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-08 01:11:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2019-09-08 01:11:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-08 01:11:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 285 transitions. [2019-09-08 01:11:07,000 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 285 transitions. Word has length 276 [2019-09-08 01:11:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:07,001 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 285 transitions. [2019-09-08 01:11:07,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 01:11:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 285 transitions. [2019-09-08 01:11:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 01:11:07,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:07,004 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:07,004 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:07,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:07,005 INFO L82 PathProgramCache]: Analyzing trace with hash 87633306, now seen corresponding path program 39 times [2019-09-08 01:11:07,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:07,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:07,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:07,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:07,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5226 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-09-08 01:11:07,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:07,778 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-08 01:11:07,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:07,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-08 01:11:07,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:07,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 01:11:07,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5226 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-09-08 01:11:08,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:08,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-08 01:11:08,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 01:11:08,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 01:11:08,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:11:08,071 INFO L87 Difference]: Start difference. First operand 208 states and 285 transitions. Second operand 42 states. [2019-09-08 01:11:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:08,506 INFO L93 Difference]: Finished difference Result 222 states and 303 transitions. [2019-09-08 01:11:08,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 01:11:08,506 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 283 [2019-09-08 01:11:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:08,509 INFO L225 Difference]: With dead ends: 222 [2019-09-08 01:11:08,510 INFO L226 Difference]: Without dead ends: 217 [2019-09-08 01:11:08,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:11:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-08 01:11:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2019-09-08 01:11:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-08 01:11:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 292 transitions. [2019-09-08 01:11:08,518 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 292 transitions. Word has length 283 [2019-09-08 01:11:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:08,519 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 292 transitions. [2019-09-08 01:11:08,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 01:11:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 292 transitions. [2019-09-08 01:11:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-08 01:11:08,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:08,521 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:08,522 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1351445905, now seen corresponding path program 40 times [2019-09-08 01:11:08,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:08,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:08,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:08,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:08,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5500 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-08 01:11:09,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:09,272 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-08 01:11:09,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:09,374 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:09,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:09,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 01:11:09,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5500 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-08 01:11:09,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:09,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-08 01:11:09,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 01:11:09,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 01:11:09,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:11:09,465 INFO L87 Difference]: Start difference. First operand 213 states and 292 transitions. Second operand 43 states. [2019-09-08 01:11:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:10,148 INFO L93 Difference]: Finished difference Result 227 states and 310 transitions. [2019-09-08 01:11:10,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 01:11:10,148 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 290 [2019-09-08 01:11:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:10,150 INFO L225 Difference]: With dead ends: 227 [2019-09-08 01:11:10,151 INFO L226 Difference]: Without dead ends: 222 [2019-09-08 01:11:10,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:11:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-08 01:11:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2019-09-08 01:11:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-08 01:11:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 299 transitions. [2019-09-08 01:11:10,160 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 299 transitions. Word has length 290 [2019-09-08 01:11:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:10,160 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 299 transitions. [2019-09-08 01:11:10,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 01:11:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 299 transitions. [2019-09-08 01:11:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-08 01:11:10,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:10,163 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:10,163 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash 50764218, now seen corresponding path program 41 times [2019-09-08 01:11:10,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:10,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:10,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:10,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:10,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5781 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-08 01:11:10,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:10,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:11,004 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:11,137 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-08 01:11:11,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:11,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 01:11:11,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5781 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-08 01:11:11,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:11,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-08 01:11:11,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 01:11:11,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 01:11:11,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:11:11,249 INFO L87 Difference]: Start difference. First operand 218 states and 299 transitions. Second operand 44 states. [2019-09-08 01:11:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:11,905 INFO L93 Difference]: Finished difference Result 232 states and 317 transitions. [2019-09-08 01:11:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 01:11:11,905 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 297 [2019-09-08 01:11:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:11,907 INFO L225 Difference]: With dead ends: 232 [2019-09-08 01:11:11,907 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 01:11:11,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:11:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 01:11:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2019-09-08 01:11:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-08 01:11:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 306 transitions. [2019-09-08 01:11:11,918 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 306 transitions. Word has length 297 [2019-09-08 01:11:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:11,918 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 306 transitions. [2019-09-08 01:11:11,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 01:11:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 306 transitions. [2019-09-08 01:11:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 01:11:11,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:11,921 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:11,921 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1657528975, now seen corresponding path program 42 times [2019-09-08 01:11:11,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:11,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:11,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-08 01:11:12,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:12,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:12,759 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:12,900 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-08 01:11:12,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:12,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 01:11:12,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-08 01:11:13,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:13,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-08 01:11:13,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 01:11:13,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 01:11:13,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 01:11:13,016 INFO L87 Difference]: Start difference. First operand 223 states and 306 transitions. Second operand 45 states. [2019-09-08 01:11:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:13,603 INFO L93 Difference]: Finished difference Result 237 states and 324 transitions. [2019-09-08 01:11:13,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 01:11:13,604 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 304 [2019-09-08 01:11:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:13,606 INFO L225 Difference]: With dead ends: 237 [2019-09-08 01:11:13,606 INFO L226 Difference]: Without dead ends: 232 [2019-09-08 01:11:13,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 01:11:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-08 01:11:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2019-09-08 01:11:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-08 01:11:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 313 transitions. [2019-09-08 01:11:13,615 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 313 transitions. Word has length 304 [2019-09-08 01:11:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:13,616 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 313 transitions. [2019-09-08 01:11:13,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 01:11:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 313 transitions. [2019-09-08 01:11:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 01:11:13,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:13,619 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:13,619 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash 575950298, now seen corresponding path program 43 times [2019-09-08 01:11:13,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:13,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:13,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6364 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2019-09-08 01:11:14,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:14,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:14,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:14,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 01:11:14,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6364 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:14,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:14,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-08 01:11:14,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 01:11:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 01:11:14,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:11:14,776 INFO L87 Difference]: Start difference. First operand 228 states and 313 transitions. Second operand 46 states. [2019-09-08 01:11:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:15,585 INFO L93 Difference]: Finished difference Result 242 states and 331 transitions. [2019-09-08 01:11:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 01:11:15,591 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 311 [2019-09-08 01:11:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:15,593 INFO L225 Difference]: With dead ends: 242 [2019-09-08 01:11:15,593 INFO L226 Difference]: Without dead ends: 237 [2019-09-08 01:11:15,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:11:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-08 01:11:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2019-09-08 01:11:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-08 01:11:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 320 transitions. [2019-09-08 01:11:15,603 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 320 transitions. Word has length 311 [2019-09-08 01:11:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:15,603 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 320 transitions. [2019-09-08 01:11:15,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 01:11:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 320 transitions. [2019-09-08 01:11:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 01:11:15,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:15,606 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:15,606 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1828291921, now seen corresponding path program 44 times [2019-09-08 01:11:15,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:15,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:15,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:15,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:15,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6666 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-08 01:11:16,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:16,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:16,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:16,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:16,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:16,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 01:11:16,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6666 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-08 01:11:16,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:16,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-08 01:11:16,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 01:11:16,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 01:11:16,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:11:16,723 INFO L87 Difference]: Start difference. First operand 233 states and 320 transitions. Second operand 47 states. [2019-09-08 01:11:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:17,284 INFO L93 Difference]: Finished difference Result 247 states and 338 transitions. [2019-09-08 01:11:17,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 01:11:17,284 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 318 [2019-09-08 01:11:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:17,287 INFO L225 Difference]: With dead ends: 247 [2019-09-08 01:11:17,287 INFO L226 Difference]: Without dead ends: 242 [2019-09-08 01:11:17,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:11:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-08 01:11:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2019-09-08 01:11:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-08 01:11:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 327 transitions. [2019-09-08 01:11:17,296 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 327 transitions. Word has length 318 [2019-09-08 01:11:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:17,297 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 327 transitions. [2019-09-08 01:11:17,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 01:11:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 327 transitions. [2019-09-08 01:11:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 01:11:17,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:17,299 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:17,300 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2030324218, now seen corresponding path program 45 times [2019-09-08 01:11:17,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:17,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:17,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6975 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2019-09-08 01:11:18,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:18,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:18,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:18,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-08 01:11:18,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:18,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 01:11:18,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6975 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2019-09-08 01:11:18,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:18,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-08 01:11:18,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 01:11:18,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 01:11:18,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:11:18,531 INFO L87 Difference]: Start difference. First operand 238 states and 327 transitions. Second operand 48 states. [2019-09-08 01:11:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:19,379 INFO L93 Difference]: Finished difference Result 252 states and 345 transitions. [2019-09-08 01:11:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 01:11:19,379 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 325 [2019-09-08 01:11:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:19,381 INFO L225 Difference]: With dead ends: 252 [2019-09-08 01:11:19,381 INFO L226 Difference]: Without dead ends: 247 [2019-09-08 01:11:19,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:11:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-08 01:11:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2019-09-08 01:11:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-08 01:11:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2019-09-08 01:11:19,389 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 325 [2019-09-08 01:11:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:19,390 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2019-09-08 01:11:19,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 01:11:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2019-09-08 01:11:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 01:11:19,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:19,392 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:19,393 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:19,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:19,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1480874703, now seen corresponding path program 46 times [2019-09-08 01:11:19,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:19,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:19,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:19,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:19,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7291 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2019-09-08 01:11:20,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:20,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:20,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:20,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:20,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:20,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 01:11:20,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7291 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2019-09-08 01:11:20,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:20,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-08 01:11:20,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 01:11:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 01:11:20,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:11:20,624 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand 49 states. [2019-09-08 01:11:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:21,226 INFO L93 Difference]: Finished difference Result 257 states and 352 transitions. [2019-09-08 01:11:21,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 01:11:21,226 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 332 [2019-09-08 01:11:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:21,228 INFO L225 Difference]: With dead ends: 257 [2019-09-08 01:11:21,228 INFO L226 Difference]: Without dead ends: 252 [2019-09-08 01:11:21,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:11:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-08 01:11:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2019-09-08 01:11:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-08 01:11:21,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 341 transitions. [2019-09-08 01:11:21,237 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 341 transitions. Word has length 332 [2019-09-08 01:11:21,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:21,238 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 341 transitions. [2019-09-08 01:11:21,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 01:11:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 341 transitions. [2019-09-08 01:11:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 01:11:21,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:21,241 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:21,241 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:21,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:21,241 INFO L82 PathProgramCache]: Analyzing trace with hash 695766554, now seen corresponding path program 47 times [2019-09-08 01:11:21,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:21,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:21,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:21,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7614 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-09-08 01:11:22,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:22,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:22,265 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:22,416 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-08 01:11:22,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:22,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 01:11:22,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7614 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-09-08 01:11:22,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:22,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-08 01:11:22,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 01:11:22,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 01:11:22,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:11:22,581 INFO L87 Difference]: Start difference. First operand 248 states and 341 transitions. Second operand 50 states. [2019-09-08 01:11:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:23,368 INFO L93 Difference]: Finished difference Result 262 states and 359 transitions. [2019-09-08 01:11:23,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 01:11:23,369 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 339 [2019-09-08 01:11:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:23,370 INFO L225 Difference]: With dead ends: 262 [2019-09-08 01:11:23,371 INFO L226 Difference]: Without dead ends: 257 [2019-09-08 01:11:23,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:11:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-08 01:11:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 253. [2019-09-08 01:11:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-08 01:11:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 348 transitions. [2019-09-08 01:11:23,380 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 348 transitions. Word has length 339 [2019-09-08 01:11:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:23,380 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 348 transitions. [2019-09-08 01:11:23,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 01:11:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 348 transitions. [2019-09-08 01:11:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-08 01:11:23,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:23,383 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:23,384 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:23,384 INFO L82 PathProgramCache]: Analyzing trace with hash 416840977, now seen corresponding path program 48 times [2019-09-08 01:11:23,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:23,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:23,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:23,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:23,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7944 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2019-09-08 01:11:24,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:24,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:24,496 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:24,662 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-08 01:11:24,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:24,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 01:11:24,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7944 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2019-09-08 01:11:24,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:24,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-08 01:11:24,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 01:11:24,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 01:11:24,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:11:24,803 INFO L87 Difference]: Start difference. First operand 253 states and 348 transitions. Second operand 51 states. [2019-09-08 01:11:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:25,681 INFO L93 Difference]: Finished difference Result 267 states and 366 transitions. [2019-09-08 01:11:25,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 01:11:25,682 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 346 [2019-09-08 01:11:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:25,683 INFO L225 Difference]: With dead ends: 267 [2019-09-08 01:11:25,683 INFO L226 Difference]: Without dead ends: 262 [2019-09-08 01:11:25,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:11:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-08 01:11:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2019-09-08 01:11:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-08 01:11:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 355 transitions. [2019-09-08 01:11:25,691 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 355 transitions. Word has length 346 [2019-09-08 01:11:25,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:25,692 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 355 transitions. [2019-09-08 01:11:25,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 01:11:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 355 transitions. [2019-09-08 01:11:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 01:11:25,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:25,694 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:25,695 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:25,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2104288710, now seen corresponding path program 49 times [2019-09-08 01:11:25,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:25,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:25,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:25,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:25,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-09-08 01:11:27,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:27,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:27,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:27,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 01:11:27,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-09-08 01:11:27,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:27,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-08 01:11:27,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 01:11:27,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 01:11:27,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:11:27,308 INFO L87 Difference]: Start difference. First operand 258 states and 355 transitions. Second operand 52 states. [2019-09-08 01:11:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:27,945 INFO L93 Difference]: Finished difference Result 272 states and 373 transitions. [2019-09-08 01:11:27,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 01:11:27,947 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 353 [2019-09-08 01:11:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:27,949 INFO L225 Difference]: With dead ends: 272 [2019-09-08 01:11:27,949 INFO L226 Difference]: Without dead ends: 267 [2019-09-08 01:11:27,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:11:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-08 01:11:27,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2019-09-08 01:11:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-08 01:11:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 362 transitions. [2019-09-08 01:11:27,957 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 362 transitions. Word has length 353 [2019-09-08 01:11:27,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:27,958 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 362 transitions. [2019-09-08 01:11:27,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 01:11:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 362 transitions. [2019-09-08 01:11:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-08 01:11:27,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:27,961 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:27,961 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:27,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:27,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1328418033, now seen corresponding path program 50 times [2019-09-08 01:11:27,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:27,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:27,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:27,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8625 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-08 01:11:29,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:29,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:29,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:29,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:29,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:29,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 01:11:29,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8625 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-08 01:11:29,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:29,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-08 01:11:29,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 01:11:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 01:11:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:11:29,582 INFO L87 Difference]: Start difference. First operand 263 states and 362 transitions. Second operand 53 states. [2019-09-08 01:11:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:30,556 INFO L93 Difference]: Finished difference Result 277 states and 380 transitions. [2019-09-08 01:11:30,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 01:11:30,557 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 360 [2019-09-08 01:11:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:30,558 INFO L225 Difference]: With dead ends: 277 [2019-09-08 01:11:30,559 INFO L226 Difference]: Without dead ends: 272 [2019-09-08 01:11:30,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:11:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-08 01:11:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 268. [2019-09-08 01:11:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-08 01:11:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 369 transitions. [2019-09-08 01:11:30,566 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 369 transitions. Word has length 360 [2019-09-08 01:11:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:30,567 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 369 transitions. [2019-09-08 01:11:30,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 01:11:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 369 transitions. [2019-09-08 01:11:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-08 01:11:30,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:30,570 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:30,570 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash 532016730, now seen corresponding path program 51 times [2019-09-08 01:11:30,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:30,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:30,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:30,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:30,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-08 01:11:31,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:31,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:31,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:31,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-08 01:11:31,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:31,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 01:11:31,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-08 01:11:31,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:31,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-08 01:11:31,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-08 01:11:31,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-08 01:11:31,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:11:31,988 INFO L87 Difference]: Start difference. First operand 268 states and 369 transitions. Second operand 54 states. [2019-09-08 01:11:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:33,012 INFO L93 Difference]: Finished difference Result 282 states and 387 transitions. [2019-09-08 01:11:33,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 01:11:33,013 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 367 [2019-09-08 01:11:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:33,014 INFO L225 Difference]: With dead ends: 282 [2019-09-08 01:11:33,014 INFO L226 Difference]: Without dead ends: 277 [2019-09-08 01:11:33,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:11:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-08 01:11:33,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2019-09-08 01:11:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-08 01:11:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 376 transitions. [2019-09-08 01:11:33,022 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 376 transitions. Word has length 367 [2019-09-08 01:11:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:33,022 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 376 transitions. [2019-09-08 01:11:33,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-08 01:11:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2019-09-08 01:11:33,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-08 01:11:33,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:33,025 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:33,026 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:33,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:33,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2098877649, now seen corresponding path program 52 times [2019-09-08 01:11:33,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:33,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:33,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:33,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:33,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9334 backedges. 0 proven. 6682 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2019-09-08 01:11:34,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:34,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:34,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:34,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:34,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:34,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 01:11:34,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9334 backedges. 0 proven. 6682 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2019-09-08 01:11:34,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:34,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-08 01:11:34,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-08 01:11:34,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-08 01:11:34,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:11:34,508 INFO L87 Difference]: Start difference. First operand 273 states and 376 transitions. Second operand 55 states. [2019-09-08 01:11:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:35,527 INFO L93 Difference]: Finished difference Result 287 states and 394 transitions. [2019-09-08 01:11:35,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 01:11:35,528 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 374 [2019-09-08 01:11:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:35,529 INFO L225 Difference]: With dead ends: 287 [2019-09-08 01:11:35,529 INFO L226 Difference]: Without dead ends: 282 [2019-09-08 01:11:35,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:11:35,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-08 01:11:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2019-09-08 01:11:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-08 01:11:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 383 transitions. [2019-09-08 01:11:35,538 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 383 transitions. Word has length 374 [2019-09-08 01:11:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:35,538 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 383 transitions. [2019-09-08 01:11:35,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-08 01:11:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 383 transitions. [2019-09-08 01:11:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-08 01:11:35,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:35,542 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:35,542 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash 146999930, now seen corresponding path program 53 times [2019-09-08 01:11:35,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:35,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:35,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:35,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9699 backedges. 0 proven. 6943 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2019-09-08 01:11:36,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:36,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:36,765 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:36,935 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-08 01:11:36,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:36,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 01:11:36,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9699 backedges. 0 proven. 6943 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2019-09-08 01:11:37,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:37,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-09-08 01:11:37,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-08 01:11:37,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-08 01:11:37,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:11:37,043 INFO L87 Difference]: Start difference. First operand 278 states and 383 transitions. Second operand 56 states. [2019-09-08 01:11:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:37,740 INFO L93 Difference]: Finished difference Result 292 states and 401 transitions. [2019-09-08 01:11:37,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 01:11:37,741 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 381 [2019-09-08 01:11:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:37,743 INFO L225 Difference]: With dead ends: 292 [2019-09-08 01:11:37,744 INFO L226 Difference]: Without dead ends: 287 [2019-09-08 01:11:37,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:11:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-08 01:11:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2019-09-08 01:11:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-08 01:11:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 390 transitions. [2019-09-08 01:11:37,752 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 390 transitions. Word has length 381 [2019-09-08 01:11:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:37,752 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 390 transitions. [2019-09-08 01:11:37,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-08 01:11:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 390 transitions. [2019-09-08 01:11:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 01:11:37,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:37,756 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:37,756 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1484477617, now seen corresponding path program 54 times [2019-09-08 01:11:37,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:37,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:37,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:37,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10071 backedges. 0 proven. 7209 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2019-09-08 01:11:39,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:39,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:39,013 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:39,191 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-08 01:11:39,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:39,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 01:11:39,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10071 backedges. 0 proven. 7209 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2019-09-08 01:11:39,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:39,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-08 01:11:39,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 01:11:39,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 01:11:39,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:11:39,296 INFO L87 Difference]: Start difference. First operand 283 states and 390 transitions. Second operand 57 states. [2019-09-08 01:11:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:40,437 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2019-09-08 01:11:40,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 01:11:40,438 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 388 [2019-09-08 01:11:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:40,439 INFO L225 Difference]: With dead ends: 297 [2019-09-08 01:11:40,439 INFO L226 Difference]: Without dead ends: 292 [2019-09-08 01:11:40,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:11:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-08 01:11:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2019-09-08 01:11:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-08 01:11:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 397 transitions. [2019-09-08 01:11:40,447 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 397 transitions. Word has length 388 [2019-09-08 01:11:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:40,448 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 397 transitions. [2019-09-08 01:11:40,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 01:11:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 397 transitions. [2019-09-08 01:11:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 01:11:40,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:40,451 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:40,451 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:40,452 INFO L82 PathProgramCache]: Analyzing trace with hash -769888614, now seen corresponding path program 55 times [2019-09-08 01:11:40,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:40,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:40,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:40,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:40,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10450 backedges. 0 proven. 7480 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2019-09-08 01:11:41,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:41,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:41,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:41,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 01:11:41,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10450 backedges. 0 proven. 7480 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2019-09-08 01:11:42,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:42,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-09-08 01:11:42,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-08 01:11:42,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-08 01:11:42,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 01:11:42,037 INFO L87 Difference]: Start difference. First operand 288 states and 397 transitions. Second operand 58 states. [2019-09-08 01:11:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:43,206 INFO L93 Difference]: Finished difference Result 302 states and 415 transitions. [2019-09-08 01:11:43,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 01:11:43,207 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 395 [2019-09-08 01:11:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:43,208 INFO L225 Difference]: With dead ends: 302 [2019-09-08 01:11:43,208 INFO L226 Difference]: Without dead ends: 297 [2019-09-08 01:11:43,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 01:11:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-08 01:11:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2019-09-08 01:11:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-08 01:11:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 404 transitions. [2019-09-08 01:11:43,216 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 404 transitions. Word has length 395 [2019-09-08 01:11:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:43,217 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 404 transitions. [2019-09-08 01:11:43,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-08 01:11:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 404 transitions. [2019-09-08 01:11:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-08 01:11:43,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:43,220 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:43,220 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:43,221 INFO L82 PathProgramCache]: Analyzing trace with hash -89191279, now seen corresponding path program 56 times [2019-09-08 01:11:43,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:43,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:43,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:43,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:43,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10836 backedges. 0 proven. 7756 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2019-09-08 01:11:44,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:44,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:44,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:44,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:44,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:44,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 01:11:44,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10836 backedges. 0 proven. 7756 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2019-09-08 01:11:44,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:44,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-08 01:11:44,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 01:11:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 01:11:44,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 01:11:44,806 INFO L87 Difference]: Start difference. First operand 293 states and 404 transitions. Second operand 59 states. [2019-09-08 01:11:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:45,865 INFO L93 Difference]: Finished difference Result 307 states and 422 transitions. [2019-09-08 01:11:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 01:11:45,865 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 402 [2019-09-08 01:11:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:45,867 INFO L225 Difference]: With dead ends: 307 [2019-09-08 01:11:45,867 INFO L226 Difference]: Without dead ends: 302 [2019-09-08 01:11:45,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 01:11:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-08 01:11:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-09-08 01:11:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-08 01:11:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 411 transitions. [2019-09-08 01:11:45,874 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 411 transitions. Word has length 402 [2019-09-08 01:11:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:45,875 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 411 transitions. [2019-09-08 01:11:45,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 01:11:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 411 transitions. [2019-09-08 01:11:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 01:11:45,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:45,878 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:45,878 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:45,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1130095942, now seen corresponding path program 57 times [2019-09-08 01:11:45,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:45,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:45,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:45,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:45,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11229 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2019-09-08 01:11:47,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:47,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:47,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:47,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-08 01:11:47,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:47,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 01:11:47,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11229 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2019-09-08 01:11:47,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:47,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-09-08 01:11:47,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-08 01:11:47,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-08 01:11:47,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:11:47,537 INFO L87 Difference]: Start difference. First operand 298 states and 411 transitions. Second operand 60 states. [2019-09-08 01:11:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:48,851 INFO L93 Difference]: Finished difference Result 312 states and 429 transitions. [2019-09-08 01:11:48,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 01:11:48,852 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 409 [2019-09-08 01:11:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:48,855 INFO L225 Difference]: With dead ends: 312 [2019-09-08 01:11:48,855 INFO L226 Difference]: Without dead ends: 307 [2019-09-08 01:11:48,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:11:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-08 01:11:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2019-09-08 01:11:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 01:11:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 418 transitions. [2019-09-08 01:11:48,868 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 418 transitions. Word has length 409 [2019-09-08 01:11:48,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:48,869 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 418 transitions. [2019-09-08 01:11:48,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-08 01:11:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 418 transitions. [2019-09-08 01:11:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 01:11:48,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:48,876 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:48,878 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1064076175, now seen corresponding path program 58 times [2019-09-08 01:11:48,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:48,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:48,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:48,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:48,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 11629 backedges. 0 proven. 8323 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2019-09-08 01:11:51,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:51,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:51,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:52,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:52,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:52,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 01:11:52,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11629 backedges. 0 proven. 8323 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2019-09-08 01:11:52,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:52,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-08 01:11:52,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-08 01:11:52,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-08 01:11:52,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:11:52,210 INFO L87 Difference]: Start difference. First operand 303 states and 418 transitions. Second operand 61 states. [2019-09-08 01:11:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:53,211 INFO L93 Difference]: Finished difference Result 317 states and 436 transitions. [2019-09-08 01:11:53,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 01:11:53,211 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 416 [2019-09-08 01:11:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:53,213 INFO L225 Difference]: With dead ends: 317 [2019-09-08 01:11:53,213 INFO L226 Difference]: Without dead ends: 312 [2019-09-08 01:11:53,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:11:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-08 01:11:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2019-09-08 01:11:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-08 01:11:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 425 transitions. [2019-09-08 01:11:53,220 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 425 transitions. Word has length 416 [2019-09-08 01:11:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:53,221 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 425 transitions. [2019-09-08 01:11:53,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-08 01:11:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 425 transitions. [2019-09-08 01:11:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-09-08 01:11:53,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:53,224 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:53,225 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash -709095718, now seen corresponding path program 59 times [2019-09-08 01:11:53,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:53,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:53,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:53,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:53,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12036 backedges. 0 proven. 8614 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2019-09-08 01:11:54,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:54,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:54,715 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:54,911 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-08 01:11:54,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:54,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 01:11:54,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12036 backedges. 0 proven. 8614 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2019-09-08 01:11:55,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:55,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-09-08 01:11:55,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-08 01:11:55,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-08 01:11:55,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 01:11:55,035 INFO L87 Difference]: Start difference. First operand 308 states and 425 transitions. Second operand 62 states. [2019-09-08 01:11:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:55,848 INFO L93 Difference]: Finished difference Result 322 states and 443 transitions. [2019-09-08 01:11:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-08 01:11:55,848 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 423 [2019-09-08 01:11:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:55,850 INFO L225 Difference]: With dead ends: 322 [2019-09-08 01:11:55,850 INFO L226 Difference]: Without dead ends: 317 [2019-09-08 01:11:55,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 01:11:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-08 01:11:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2019-09-08 01:11:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-08 01:11:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 432 transitions. [2019-09-08 01:11:55,859 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 432 transitions. Word has length 423 [2019-09-08 01:11:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:55,860 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 432 transitions. [2019-09-08 01:11:55,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-08 01:11:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 432 transitions. [2019-09-08 01:11:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-09-08 01:11:55,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:55,863 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:55,863 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:55,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash 713466961, now seen corresponding path program 60 times [2019-09-08 01:11:55,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:55,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:55,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 0 proven. 8910 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2019-09-08 01:11:57,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:57,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:57,385 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:57,590 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-08 01:11:57,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:57,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 01:11:57,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 0 proven. 8910 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2019-09-08 01:11:57,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:57,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-08 01:11:57,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-08 01:11:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-08 01:11:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:11:57,745 INFO L87 Difference]: Start difference. First operand 313 states and 432 transitions. Second operand 63 states. [2019-09-08 01:11:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:58,622 INFO L93 Difference]: Finished difference Result 327 states and 450 transitions. [2019-09-08 01:11:58,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 01:11:58,623 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 430 [2019-09-08 01:11:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:58,624 INFO L225 Difference]: With dead ends: 327 [2019-09-08 01:11:58,624 INFO L226 Difference]: Without dead ends: 322 [2019-09-08 01:11:58,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:11:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-08 01:11:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2019-09-08 01:11:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-08 01:11:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 439 transitions. [2019-09-08 01:11:58,632 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 439 transitions. Word has length 430 [2019-09-08 01:11:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:58,632 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 439 transitions. [2019-09-08 01:11:58,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-08 01:11:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 439 transitions. [2019-09-08 01:11:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-08 01:11:58,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:58,635 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:58,635 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:58,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:58,636 INFO L82 PathProgramCache]: Analyzing trace with hash 390482682, now seen corresponding path program 61 times [2019-09-08 01:11:58,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:58,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:58,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:58,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:58,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12871 backedges. 0 proven. 9211 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2019-09-08 01:12:00,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:00,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:00,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:00,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 01:12:00,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12871 backedges. 0 proven. 9211 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2019-09-08 01:12:00,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:00,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-09-08 01:12:00,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-08 01:12:00,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-08 01:12:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:12:00,515 INFO L87 Difference]: Start difference. First operand 318 states and 439 transitions. Second operand 64 states. [2019-09-08 01:12:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:01,411 INFO L93 Difference]: Finished difference Result 332 states and 457 transitions. [2019-09-08 01:12:01,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 01:12:01,411 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 437 [2019-09-08 01:12:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:01,413 INFO L225 Difference]: With dead ends: 332 [2019-09-08 01:12:01,413 INFO L226 Difference]: Without dead ends: 327 [2019-09-08 01:12:01,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:12:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-08 01:12:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2019-09-08 01:12:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-08 01:12:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 446 transitions. [2019-09-08 01:12:01,420 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 446 transitions. Word has length 437 [2019-09-08 01:12:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:01,421 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 446 transitions. [2019-09-08 01:12:01,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-08 01:12:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 446 transitions. [2019-09-08 01:12:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-08 01:12:01,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:01,423 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:01,423 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:01,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1134132175, now seen corresponding path program 62 times [2019-09-08 01:12:01,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:01,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:01,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:01,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:01,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13299 backedges. 0 proven. 9517 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2019-09-08 01:12:02,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:02,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:03,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:12:03,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:12:03,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:03,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 01:12:03,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 13299 backedges. 0 proven. 9517 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2019-09-08 01:12:03,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:03,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-08 01:12:03,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-08 01:12:03,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-08 01:12:03,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:12:03,265 INFO L87 Difference]: Start difference. First operand 323 states and 446 transitions. Second operand 65 states. [2019-09-08 01:12:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:04,058 INFO L93 Difference]: Finished difference Result 337 states and 464 transitions. [2019-09-08 01:12:04,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 01:12:04,059 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 444 [2019-09-08 01:12:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:04,060 INFO L225 Difference]: With dead ends: 337 [2019-09-08 01:12:04,061 INFO L226 Difference]: Without dead ends: 332 [2019-09-08 01:12:04,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:12:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-08 01:12:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-09-08 01:12:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-08 01:12:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 453 transitions. [2019-09-08 01:12:04,067 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 453 transitions. Word has length 444 [2019-09-08 01:12:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:04,068 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 453 transitions. [2019-09-08 01:12:04,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-08 01:12:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 453 transitions. [2019-09-08 01:12:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-09-08 01:12:04,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:04,071 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:04,072 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:04,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2019242214, now seen corresponding path program 63 times [2019-09-08 01:12:04,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:04,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:04,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:04,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:04,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13734 backedges. 0 proven. 9828 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2019-09-08 01:12:05,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:05,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:05,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:12:05,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-08 01:12:05,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:05,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 01:12:05,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 13734 backedges. 0 proven. 9828 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2019-09-08 01:12:06,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:06,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-09-08 01:12:06,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-08 01:12:06,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-08 01:12:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 01:12:06,045 INFO L87 Difference]: Start difference. First operand 328 states and 453 transitions. Second operand 66 states. [2019-09-08 01:12:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:07,042 INFO L93 Difference]: Finished difference Result 342 states and 471 transitions. [2019-09-08 01:12:07,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 01:12:07,043 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 451 [2019-09-08 01:12:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:07,044 INFO L225 Difference]: With dead ends: 342 [2019-09-08 01:12:07,045 INFO L226 Difference]: Without dead ends: 337 [2019-09-08 01:12:07,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 01:12:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-08 01:12:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2019-09-08 01:12:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 01:12:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 460 transitions. [2019-09-08 01:12:07,053 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 460 transitions. Word has length 451 [2019-09-08 01:12:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:07,053 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 460 transitions. [2019-09-08 01:12:07,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-08 01:12:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 460 transitions. [2019-09-08 01:12:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2019-09-08 01:12:07,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:07,057 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:07,057 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash -577692655, now seen corresponding path program 64 times [2019-09-08 01:12:07,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:07,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:07,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:07,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:07,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14176 backedges. 0 proven. 10144 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2019-09-08 01:12:08,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:08,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:08,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:12:08,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:12:08,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:08,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-08 01:12:08,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 14176 backedges. 0 proven. 10144 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (65)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:12:09,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:09,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-08 01:12:09,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-08 01:12:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-08 01:12:09,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:12:09,163 INFO L87 Difference]: Start difference. First operand 333 states and 460 transitions. Second operand 67 states. [2019-09-08 01:12:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:09,939 INFO L93 Difference]: Finished difference Result 347 states and 478 transitions. [2019-09-08 01:12:09,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 01:12:09,940 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 458 [2019-09-08 01:12:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:09,943 INFO L225 Difference]: With dead ends: 347 [2019-09-08 01:12:09,943 INFO L226 Difference]: Without dead ends: 342 [2019-09-08 01:12:09,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:12:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-08 01:12:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2019-09-08 01:12:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-08 01:12:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 467 transitions. [2019-09-08 01:12:09,951 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 467 transitions. Word has length 458 [2019-09-08 01:12:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:09,952 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 467 transitions. [2019-09-08 01:12:09,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-08 01:12:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 467 transitions. [2019-09-08 01:12:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-09-08 01:12:09,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:09,956 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:09,956 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:09,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:09,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1505336122, now seen corresponding path program 65 times [2019-09-08 01:12:09,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:09,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:09,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14625 backedges. 0 proven. 10465 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2019-09-08 01:12:11,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:11,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:11,741 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:12:11,975 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-09-08 01:12:11,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:11,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 01:12:11,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 14625 backedges. 0 proven. 10465 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2019-09-08 01:12:12,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:12,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-09-08 01:12:12,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-08 01:12:12,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-08 01:12:12,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:12:12,130 INFO L87 Difference]: Start difference. First operand 338 states and 467 transitions. Second operand 68 states. [2019-09-08 01:12:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:13,064 INFO L93 Difference]: Finished difference Result 352 states and 485 transitions. [2019-09-08 01:12:13,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 01:12:13,065 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 465 [2019-09-08 01:12:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:13,066 INFO L225 Difference]: With dead ends: 352 [2019-09-08 01:12:13,067 INFO L226 Difference]: Without dead ends: 347 [2019-09-08 01:12:13,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:12:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-08 01:12:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2019-09-08 01:12:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-08 01:12:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 474 transitions. [2019-09-08 01:12:13,074 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 474 transitions. Word has length 465 [2019-09-08 01:12:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:13,075 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 474 transitions. [2019-09-08 01:12:13,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-08 01:12:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 474 transitions. [2019-09-08 01:12:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-09-08 01:12:13,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:13,078 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:13,079 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1192989711, now seen corresponding path program 66 times [2019-09-08 01:12:13,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:13,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:13,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:13,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:13,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15081 backedges. 0 proven. 10791 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2019-09-08 01:12:14,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:14,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:14,889 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:15,153 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-08 01:12:15,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:15,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-08 01:12:15,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15081 backedges. 0 proven. 10791 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2019-09-08 01:12:15,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:15,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-08 01:12:15,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-08 01:12:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-08 01:12:15,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:12:15,296 INFO L87 Difference]: Start difference. First operand 343 states and 474 transitions. Second operand 69 states. [2019-09-08 01:12:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:16,403 INFO L93 Difference]: Finished difference Result 357 states and 492 transitions. [2019-09-08 01:12:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 01:12:16,403 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 472 [2019-09-08 01:12:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:16,405 INFO L225 Difference]: With dead ends: 357 [2019-09-08 01:12:16,405 INFO L226 Difference]: Without dead ends: 352 [2019-09-08 01:12:16,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:12:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-08 01:12:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-09-08 01:12:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-08 01:12:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 481 transitions. [2019-09-08 01:12:16,412 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 481 transitions. Word has length 472 [2019-09-08 01:12:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:16,412 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 481 transitions. [2019-09-08 01:12:16,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-08 01:12:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 481 transitions. [2019-09-08 01:12:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-08 01:12:16,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:16,416 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:16,416 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash 216444762, now seen corresponding path program 67 times [2019-09-08 01:12:16,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:16,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:16,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:16,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:16,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15544 backedges. 0 proven. 11122 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2019-09-08 01:12:18,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:18,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:18,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:18,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-08 01:12:18,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15544 backedges. 0 proven. 11122 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (68)] Exception during sending of exit command (exit): Stream closed [2019-09-08 01:12:18,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:18,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-09-08 01:12:18,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-08 01:12:18,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-08 01:12:18,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:12:18,617 INFO L87 Difference]: Start difference. First operand 348 states and 481 transitions. Second operand 70 states. [2019-09-08 01:12:19,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:19,307 INFO L93 Difference]: Finished difference Result 362 states and 499 transitions. [2019-09-08 01:12:19,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 01:12:19,308 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 479 [2019-09-08 01:12:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:19,310 INFO L225 Difference]: With dead ends: 362 [2019-09-08 01:12:19,310 INFO L226 Difference]: Without dead ends: 357 [2019-09-08 01:12:19,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:12:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-09-08 01:12:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2019-09-08 01:12:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-08 01:12:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 488 transitions. [2019-09-08 01:12:19,317 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 488 transitions. Word has length 479 [2019-09-08 01:12:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:19,318 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 488 transitions. [2019-09-08 01:12:19,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-08 01:12:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 488 transitions. [2019-09-08 01:12:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-09-08 01:12:19,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:19,321 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:19,321 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:19,322 INFO L82 PathProgramCache]: Analyzing trace with hash 482243537, now seen corresponding path program 68 times [2019-09-08 01:12:19,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:19,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:19,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:19,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:19,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16014 backedges. 0 proven. 11458 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2019-09-08 01:12:21,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:21,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:21,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:12:21,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:12:21,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:21,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 1246 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 01:12:21,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16014 backedges. 0 proven. 11458 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2019-09-08 01:12:21,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:21,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-08 01:12:21,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-08 01:12:21,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-08 01:12:21,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 01:12:21,487 INFO L87 Difference]: Start difference. First operand 353 states and 488 transitions. Second operand 71 states. [2019-09-08 01:12:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:22,630 INFO L93 Difference]: Finished difference Result 367 states and 506 transitions. [2019-09-08 01:12:22,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-08 01:12:22,631 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 486 [2019-09-08 01:12:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:22,633 INFO L225 Difference]: With dead ends: 367 [2019-09-08 01:12:22,633 INFO L226 Difference]: Without dead ends: 362 [2019-09-08 01:12:22,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 01:12:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-08 01:12:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2019-09-08 01:12:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-09-08 01:12:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 495 transitions. [2019-09-08 01:12:22,639 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 495 transitions. Word has length 486 [2019-09-08 01:12:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:22,639 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 495 transitions. [2019-09-08 01:12:22,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-08 01:12:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 495 transitions. [2019-09-08 01:12:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-08 01:12:22,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:22,660 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:22,660 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:22,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1928459398, now seen corresponding path program 69 times [2019-09-08 01:12:22,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:22,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:22,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:22,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16491 backedges. 0 proven. 11799 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2019-09-08 01:12:24,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:24,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:24,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:12:24,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-08 01:12:24,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:24,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 01:12:24,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16491 backedges. 0 proven. 11799 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2019-09-08 01:12:25,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:25,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-09-08 01:12:25,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-08 01:12:25,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-08 01:12:25,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:12:25,014 INFO L87 Difference]: Start difference. First operand 358 states and 495 transitions. Second operand 72 states. [2019-09-08 01:12:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:26,173 INFO L93 Difference]: Finished difference Result 372 states and 513 transitions. [2019-09-08 01:12:26,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-08 01:12:26,174 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 493 [2019-09-08 01:12:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:26,178 INFO L225 Difference]: With dead ends: 372 [2019-09-08 01:12:26,178 INFO L226 Difference]: Without dead ends: 367 [2019-09-08 01:12:26,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:12:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-09-08 01:12:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2019-09-08 01:12:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-08 01:12:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 502 transitions. [2019-09-08 01:12:26,187 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 502 transitions. Word has length 493 [2019-09-08 01:12:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:26,187 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 502 transitions. [2019-09-08 01:12:26,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-08 01:12:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 502 transitions. [2019-09-08 01:12:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-08 01:12:26,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:26,191 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:26,192 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:26,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1526543281, now seen corresponding path program 70 times [2019-09-08 01:12:26,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:26,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:26,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:26,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:26,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16975 backedges. 0 proven. 12145 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2019-09-08 01:12:28,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:28,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:28,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:12:28,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:12:28,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:28,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-08 01:12:28,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16975 backedges. 0 proven. 12145 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2019-09-08 01:12:28,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:28,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-08 01:12:28,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-08 01:12:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-08 01:12:28,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:12:28,438 INFO L87 Difference]: Start difference. First operand 363 states and 502 transitions. Second operand 73 states. [2019-09-08 01:12:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:29,673 INFO L93 Difference]: Finished difference Result 377 states and 520 transitions. [2019-09-08 01:12:29,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 01:12:29,673 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 500 [2019-09-08 01:12:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:29,676 INFO L225 Difference]: With dead ends: 377 [2019-09-08 01:12:29,676 INFO L226 Difference]: Without dead ends: 372 [2019-09-08 01:12:29,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:12:29,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-08 01:12:29,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2019-09-08 01:12:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-08 01:12:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 509 transitions. [2019-09-08 01:12:29,683 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 509 transitions. Word has length 500 [2019-09-08 01:12:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:29,684 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 509 transitions. [2019-09-08 01:12:29,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-08 01:12:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 509 transitions. [2019-09-08 01:12:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-08 01:12:29,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:29,688 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:29,688 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:29,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1385279386, now seen corresponding path program 71 times [2019-09-08 01:12:29,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:29,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:29,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:29,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:29,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17466 backedges. 0 proven. 12496 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2019-09-08 01:12:31,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:31,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:31,852 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:12:32,104 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-09-08 01:12:32,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:32,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-08 01:12:32,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 17466 backedges. 0 proven. 12496 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2019-09-08 01:12:32,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:32,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-09-08 01:12:32,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-08 01:12:32,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-08 01:12:32,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:12:32,257 INFO L87 Difference]: Start difference. First operand 368 states and 509 transitions. Second operand 74 states. [2019-09-08 01:12:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:33,101 INFO L93 Difference]: Finished difference Result 382 states and 527 transitions. [2019-09-08 01:12:33,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-08 01:12:33,102 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 507 [2019-09-08 01:12:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:33,104 INFO L225 Difference]: With dead ends: 382 [2019-09-08 01:12:33,104 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 01:12:33,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:12:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 01:12:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 373. [2019-09-08 01:12:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-08 01:12:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 516 transitions. [2019-09-08 01:12:33,113 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 516 transitions. Word has length 507 [2019-09-08 01:12:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:33,114 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 516 transitions. [2019-09-08 01:12:33,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-08 01:12:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 516 transitions. [2019-09-08 01:12:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-09-08 01:12:33,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:33,118 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:33,118 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:33,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash 687778705, now seen corresponding path program 72 times [2019-09-08 01:12:33,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:33,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 17964 backedges. 0 proven. 12852 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2019-09-08 01:12:35,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:35,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:35,324 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:35,666 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-08 01:12:35,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:35,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-08 01:12:35,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17964 backedges. 0 proven. 12852 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2019-09-08 01:12:35,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:35,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-08 01:12:35,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-08 01:12:35,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-08 01:12:35,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:12:35,850 INFO L87 Difference]: Start difference. First operand 373 states and 516 transitions. Second operand 75 states. [2019-09-08 01:12:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:36,658 INFO L93 Difference]: Finished difference Result 387 states and 534 transitions. [2019-09-08 01:12:36,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 01:12:36,659 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 514 [2019-09-08 01:12:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:36,662 INFO L225 Difference]: With dead ends: 387 [2019-09-08 01:12:36,662 INFO L226 Difference]: Without dead ends: 382 [2019-09-08 01:12:36,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:12:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-08 01:12:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2019-09-08 01:12:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-09-08 01:12:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 523 transitions. [2019-09-08 01:12:36,671 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 523 transitions. Word has length 514 [2019-09-08 01:12:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:36,672 INFO L475 AbstractCegarLoop]: Abstraction has 378 states and 523 transitions. [2019-09-08 01:12:36,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-08 01:12:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 523 transitions. [2019-09-08 01:12:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2019-09-08 01:12:36,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:36,676 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:36,676 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:36,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2108449862, now seen corresponding path program 73 times [2019-09-08 01:12:36,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:36,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:36,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:36,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:36,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18469 backedges. 0 proven. 13213 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2019-09-08 01:12:38,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:38,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:38,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-08 01:12:38,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18469 backedges. 0 proven. 13213 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2019-09-08 01:12:39,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:39,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-09-08 01:12:39,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-08 01:12:39,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-08 01:12:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 01:12:39,126 INFO L87 Difference]: Start difference. First operand 378 states and 523 transitions. Second operand 76 states. [2019-09-08 01:12:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:40,014 INFO L93 Difference]: Finished difference Result 392 states and 541 transitions. [2019-09-08 01:12:40,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-08 01:12:40,014 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 521 [2019-09-08 01:12:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:40,016 INFO L225 Difference]: With dead ends: 392 [2019-09-08 01:12:40,016 INFO L226 Difference]: Without dead ends: 387 [2019-09-08 01:12:40,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 01:12:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-08 01:12:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-08 01:12:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-08 01:12:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 530 transitions. [2019-09-08 01:12:40,024 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 530 transitions. Word has length 521 [2019-09-08 01:12:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:40,024 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 530 transitions. [2019-09-08 01:12:40,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-08 01:12:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 530 transitions. [2019-09-08 01:12:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-09-08 01:12:40,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:40,029 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:40,029 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:40,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2141248369, now seen corresponding path program 74 times [2019-09-08 01:12:40,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:40,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:40,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:40,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18981 backedges. 0 proven. 13579 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2019-09-08 01:12:42,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:42,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:42,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:12:42,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:12:42,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:42,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 01:12:42,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18981 backedges. 0 proven. 13579 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2019-09-08 01:12:42,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:42,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-08 01:12:42,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-08 01:12:42,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-08 01:12:42,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:12:42,626 INFO L87 Difference]: Start difference. First operand 383 states and 530 transitions. Second operand 77 states. [2019-09-08 01:12:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:43,726 INFO L93 Difference]: Finished difference Result 397 states and 548 transitions. [2019-09-08 01:12:43,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 01:12:43,726 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 528 [2019-09-08 01:12:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:43,728 INFO L225 Difference]: With dead ends: 397 [2019-09-08 01:12:43,728 INFO L226 Difference]: Without dead ends: 392 [2019-09-08 01:12:43,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:12:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-08 01:12:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-09-08 01:12:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-08 01:12:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 537 transitions. [2019-09-08 01:12:43,735 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 537 transitions. Word has length 528 [2019-09-08 01:12:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:43,735 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 537 transitions. [2019-09-08 01:12:43,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-08 01:12:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 537 transitions. [2019-09-08 01:12:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-09-08 01:12:43,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:43,738 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:43,738 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:43,739 INFO L82 PathProgramCache]: Analyzing trace with hash 230019034, now seen corresponding path program 75 times [2019-09-08 01:12:43,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:43,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:43,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:43,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:43,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 19500 backedges. 0 proven. 13950 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2019-09-08 01:12:45,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:45,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:45,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:12:46,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-09-08 01:12:46,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:46,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-08 01:12:46,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 19500 backedges. 0 proven. 13950 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2019-09-08 01:12:46,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:46,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-09-08 01:12:46,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-08 01:12:46,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-08 01:12:46,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:12:46,436 INFO L87 Difference]: Start difference. First operand 388 states and 537 transitions. Second operand 78 states. [2019-09-08 01:12:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:47,590 INFO L93 Difference]: Finished difference Result 402 states and 555 transitions. [2019-09-08 01:12:47,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-08 01:12:47,590 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 535 [2019-09-08 01:12:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:47,593 INFO L225 Difference]: With dead ends: 402 [2019-09-08 01:12:47,593 INFO L226 Difference]: Without dead ends: 397 [2019-09-08 01:12:47,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:12:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-09-08 01:12:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 393. [2019-09-08 01:12:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-09-08 01:12:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 544 transitions. [2019-09-08 01:12:47,599 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 544 transitions. Word has length 535 [2019-09-08 01:12:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:47,600 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 544 transitions. [2019-09-08 01:12:47,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-08 01:12:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 544 transitions. [2019-09-08 01:12:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-09-08 01:12:47,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:47,603 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:47,603 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:47,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:47,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2067907409, now seen corresponding path program 76 times [2019-09-08 01:12:47,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:47,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:47,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:47,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:47,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20026 backedges. 0 proven. 14326 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2019-09-08 01:12:50,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:50,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:50,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:12:50,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:12:50,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:50,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-08 01:12:50,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 20026 backedges. 0 proven. 14326 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2019-09-08 01:12:50,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:50,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-08 01:12:50,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-08 01:12:50,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-08 01:12:50,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:12:50,385 INFO L87 Difference]: Start difference. First operand 393 states and 544 transitions. Second operand 79 states. [2019-09-08 01:12:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:51,813 INFO L93 Difference]: Finished difference Result 407 states and 562 transitions. [2019-09-08 01:12:51,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 01:12:51,813 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 542 [2019-09-08 01:12:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:51,816 INFO L225 Difference]: With dead ends: 407 [2019-09-08 01:12:51,816 INFO L226 Difference]: Without dead ends: 402 [2019-09-08 01:12:51,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:12:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-08 01:12:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2019-09-08 01:12:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-08 01:12:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 551 transitions. [2019-09-08 01:12:51,822 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 551 transitions. Word has length 542 [2019-09-08 01:12:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:51,823 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 551 transitions. [2019-09-08 01:12:51,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-08 01:12:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 551 transitions. [2019-09-08 01:12:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-09-08 01:12:51,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:51,826 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:51,826 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:51,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:51,827 INFO L82 PathProgramCache]: Analyzing trace with hash -761639942, now seen corresponding path program 77 times [2019-09-08 01:12:51,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:51,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:51,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:51,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:51,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 20559 backedges. 0 proven. 14707 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2019-09-08 01:12:54,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:54,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:54,200 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:12:54,493 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-09-08 01:12:54,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:54,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-08 01:12:54,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 20559 backedges. 0 proven. 14707 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2019-09-08 01:12:54,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:54,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-09-08 01:12:54,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-08 01:12:54,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-08 01:12:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:12:54,660 INFO L87 Difference]: Start difference. First operand 398 states and 551 transitions. Second operand 80 states. [2019-09-08 01:12:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:55,805 INFO L93 Difference]: Finished difference Result 412 states and 569 transitions. [2019-09-08 01:12:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-08 01:12:55,805 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 549 [2019-09-08 01:12:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:55,808 INFO L225 Difference]: With dead ends: 412 [2019-09-08 01:12:55,809 INFO L226 Difference]: Without dead ends: 407 [2019-09-08 01:12:55,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:12:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-08 01:12:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 403. [2019-09-08 01:12:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-08 01:12:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 558 transitions. [2019-09-08 01:12:55,817 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 558 transitions. Word has length 549 [2019-09-08 01:12:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:55,818 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 558 transitions. [2019-09-08 01:12:55,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-08 01:12:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 558 transitions. [2019-09-08 01:12:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-08 01:12:55,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:55,822 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:55,822 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:55,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1002398513, now seen corresponding path program 78 times [2019-09-08 01:12:55,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:55,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:55,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:55,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21099 backedges. 0 proven. 15093 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2019-09-08 01:12:58,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:58,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:58,234 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:58,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-08 01:12:58,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:58,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 1426 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 01:12:58,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21099 backedges. 0 proven. 15093 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2019-09-08 01:12:58,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:58,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-08 01:12:58,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-08 01:12:58,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-08 01:12:58,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 01:12:58,782 INFO L87 Difference]: Start difference. First operand 403 states and 558 transitions. Second operand 81 states. [2019-09-08 01:12:59,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:59,932 INFO L93 Difference]: Finished difference Result 417 states and 576 transitions. [2019-09-08 01:12:59,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 01:12:59,933 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 556 [2019-09-08 01:12:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:59,935 INFO L225 Difference]: With dead ends: 417 [2019-09-08 01:12:59,935 INFO L226 Difference]: Without dead ends: 412 [2019-09-08 01:12:59,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 01:12:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-09-08 01:12:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 408. [2019-09-08 01:12:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-08 01:12:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 565 transitions. [2019-09-08 01:12:59,941 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 565 transitions. Word has length 556 [2019-09-08 01:12:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:59,942 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 565 transitions. [2019-09-08 01:12:59,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-08 01:12:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 565 transitions. [2019-09-08 01:12:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-09-08 01:12:59,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:59,946 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:59,947 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1151135718, now seen corresponding path program 79 times [2019-09-08 01:12:59,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:59,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:59,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:59,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:59,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 21646 backedges. 0 proven. 15484 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2019-09-08 01:13:02,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:02,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:02,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:02,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-08 01:13:02,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 21646 backedges. 0 proven. 15484 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2019-09-08 01:13:02,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:02,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-09-08 01:13:02,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-08 01:13:02,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-08 01:13:02,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:13:02,848 INFO L87 Difference]: Start difference. First operand 408 states and 565 transitions. Second operand 82 states. [2019-09-08 01:13:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:03,910 INFO L93 Difference]: Finished difference Result 422 states and 583 transitions. [2019-09-08 01:13:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-08 01:13:03,910 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 563 [2019-09-08 01:13:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:03,912 INFO L225 Difference]: With dead ends: 422 [2019-09-08 01:13:03,912 INFO L226 Difference]: Without dead ends: 417 [2019-09-08 01:13:03,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:13:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-08 01:13:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 413. [2019-09-08 01:13:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-09-08 01:13:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 572 transitions. [2019-09-08 01:13:03,919 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 572 transitions. Word has length 563 [2019-09-08 01:13:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:03,920 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 572 transitions. [2019-09-08 01:13:03,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-08 01:13:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 572 transitions. [2019-09-08 01:13:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-09-08 01:13:03,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:03,923 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:03,923 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash -998786287, now seen corresponding path program 80 times [2019-09-08 01:13:03,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:03,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:03,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:03,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:03,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 22200 backedges. 0 proven. 15880 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2019-09-08 01:13:06,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:06,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:06,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:13:06,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:13:06,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:06,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-08 01:13:06,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 22200 backedges. 0 proven. 15880 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2019-09-08 01:13:06,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:06,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-08 01:13:06,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-08 01:13:06,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-08 01:13:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:13:06,992 INFO L87 Difference]: Start difference. First operand 413 states and 572 transitions. Second operand 83 states. [2019-09-08 01:13:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:08,108 INFO L93 Difference]: Finished difference Result 427 states and 590 transitions. [2019-09-08 01:13:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-08 01:13:08,108 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 570 [2019-09-08 01:13:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:08,111 INFO L225 Difference]: With dead ends: 427 [2019-09-08 01:13:08,111 INFO L226 Difference]: Without dead ends: 422 [2019-09-08 01:13:08,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:13:08,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-08 01:13:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 418. [2019-09-08 01:13:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-08 01:13:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 579 transitions. [2019-09-08 01:13:08,118 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 579 transitions. Word has length 570 [2019-09-08 01:13:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:08,119 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 579 transitions. [2019-09-08 01:13:08,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-08 01:13:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 579 transitions. [2019-09-08 01:13:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-09-08 01:13:08,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:08,122 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:08,123 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:08,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash -554558406, now seen corresponding path program 81 times [2019-09-08 01:13:08,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:08,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:08,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 22761 backedges. 0 proven. 16281 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2019-09-08 01:13:10,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:10,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:10,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:13:11,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-09-08 01:13:11,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:11,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-08 01:13:11,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 22761 backedges. 0 proven. 16281 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2019-09-08 01:13:11,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:11,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-09-08 01:13:11,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-08 01:13:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-08 01:13:11,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:13:11,347 INFO L87 Difference]: Start difference. First operand 418 states and 579 transitions. Second operand 84 states. [2019-09-08 01:13:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:12,614 INFO L93 Difference]: Finished difference Result 432 states and 597 transitions. [2019-09-08 01:13:12,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 01:13:12,615 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 577 [2019-09-08 01:13:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:12,617 INFO L225 Difference]: With dead ends: 432 [2019-09-08 01:13:12,617 INFO L226 Difference]: Without dead ends: 427 [2019-09-08 01:13:12,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:13:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-08 01:13:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-09-08 01:13:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-08 01:13:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 586 transitions. [2019-09-08 01:13:12,624 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 586 transitions. Word has length 577 [2019-09-08 01:13:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:12,624 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 586 transitions. [2019-09-08 01:13:12,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-08 01:13:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 586 transitions. [2019-09-08 01:13:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-09-08 01:13:12,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:12,628 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:12,628 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:12,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:12,628 INFO L82 PathProgramCache]: Analyzing trace with hash -599209231, now seen corresponding path program 82 times [2019-09-08 01:13:12,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:12,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:12,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:12,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:12,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 23329 backedges. 0 proven. 16687 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2019-09-08 01:13:15,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:15,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:15,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:13:15,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:13:15,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:15,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-08 01:13:15,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 23329 backedges. 0 proven. 16687 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2019-09-08 01:13:15,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:15,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-08 01:13:15,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-08 01:13:15,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-08 01:13:15,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:13:15,760 INFO L87 Difference]: Start difference. First operand 423 states and 586 transitions. Second operand 85 states. [2019-09-08 01:13:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:17,310 INFO L93 Difference]: Finished difference Result 437 states and 604 transitions. [2019-09-08 01:13:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-08 01:13:17,310 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 584 [2019-09-08 01:13:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:17,313 INFO L225 Difference]: With dead ends: 437 [2019-09-08 01:13:17,313 INFO L226 Difference]: Without dead ends: 432 [2019-09-08 01:13:17,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:13:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-08 01:13:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 428. [2019-09-08 01:13:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-08 01:13:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 593 transitions. [2019-09-08 01:13:17,324 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 593 transitions. Word has length 584 [2019-09-08 01:13:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:17,324 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 593 transitions. [2019-09-08 01:13:17,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-08 01:13:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 593 transitions. [2019-09-08 01:13:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-09-08 01:13:17,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:17,330 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:17,330 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1599508390, now seen corresponding path program 83 times [2019-09-08 01:13:17,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:17,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:17,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:17,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:17,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 23904 backedges. 0 proven. 17098 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2019-09-08 01:13:20,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:20,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:20,096 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:13:20,446 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-09-08 01:13:20,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:20,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-08 01:13:20,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 23904 backedges. 0 proven. 17098 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2019-09-08 01:13:20,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:20,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-09-08 01:13:20,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-08 01:13:20,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-08 01:13:20,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:13:20,645 INFO L87 Difference]: Start difference. First operand 428 states and 593 transitions. Second operand 86 states. [2019-09-08 01:13:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:22,478 INFO L93 Difference]: Finished difference Result 442 states and 611 transitions. [2019-09-08 01:13:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-08 01:13:22,479 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 591 [2019-09-08 01:13:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:22,482 INFO L225 Difference]: With dead ends: 442 [2019-09-08 01:13:22,482 INFO L226 Difference]: Without dead ends: 437 [2019-09-08 01:13:22,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:13:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-08 01:13:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-09-08 01:13:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-09-08 01:13:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 600 transitions. [2019-09-08 01:13:22,495 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 600 transitions. Word has length 591 [2019-09-08 01:13:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:22,495 INFO L475 AbstractCegarLoop]: Abstraction has 433 states and 600 transitions. [2019-09-08 01:13:22,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-08 01:13:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 600 transitions. [2019-09-08 01:13:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-09-08 01:13:22,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:22,518 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:22,519 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:22,519 INFO L82 PathProgramCache]: Analyzing trace with hash -309292335, now seen corresponding path program 84 times [2019-09-08 01:13:22,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:22,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:22,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:22,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:22,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24486 backedges. 0 proven. 17514 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2019-09-08 01:13:25,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:25,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:25,273 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:13:25,638 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-09-08 01:13:25,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:25,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 1534 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 01:13:25,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 24486 backedges. 0 proven. 17514 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2019-09-08 01:13:25,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:25,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-08 01:13:25,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-08 01:13:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-08 01:13:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 01:13:25,886 INFO L87 Difference]: Start difference. First operand 433 states and 600 transitions. Second operand 87 states. [2019-09-08 01:13:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:27,569 INFO L93 Difference]: Finished difference Result 447 states and 618 transitions. [2019-09-08 01:13:27,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 01:13:27,569 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 598 [2019-09-08 01:13:27,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:27,572 INFO L225 Difference]: With dead ends: 447 [2019-09-08 01:13:27,572 INFO L226 Difference]: Without dead ends: 442 [2019-09-08 01:13:27,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 01:13:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-08 01:13:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 438. [2019-09-08 01:13:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-09-08 01:13:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 607 transitions. [2019-09-08 01:13:27,581 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 607 transitions. Word has length 598 [2019-09-08 01:13:27,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:27,582 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 607 transitions. [2019-09-08 01:13:27,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-08 01:13:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 607 transitions. [2019-09-08 01:13:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-09-08 01:13:27,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:27,586 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 85, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:27,586 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:27,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash -798290822, now seen corresponding path program 85 times [2019-09-08 01:13:27,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:27,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:27,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 25075 backedges. 0 proven. 17935 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2019-09-08 01:13:30,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:30,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:30,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:30,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-08 01:13:30,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 25075 backedges. 0 proven. 17935 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2019-09-08 01:13:30,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:30,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-09-08 01:13:30,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-08 01:13:30,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-08 01:13:30,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:13:30,978 INFO L87 Difference]: Start difference. First operand 438 states and 607 transitions. Second operand 88 states. [2019-09-08 01:13:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:32,104 INFO L93 Difference]: Finished difference Result 452 states and 625 transitions. [2019-09-08 01:13:32,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-08 01:13:32,104 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 605 [2019-09-08 01:13:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:32,108 INFO L225 Difference]: With dead ends: 452 [2019-09-08 01:13:32,108 INFO L226 Difference]: Without dead ends: 447 [2019-09-08 01:13:32,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:13:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-09-08 01:13:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2019-09-08 01:13:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-09-08 01:13:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 614 transitions. [2019-09-08 01:13:32,116 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 614 transitions. Word has length 605 [2019-09-08 01:13:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:32,117 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 614 transitions. [2019-09-08 01:13:32,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-08 01:13:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 614 transitions. [2019-09-08 01:13:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-09-08 01:13:32,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:32,121 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:32,121 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:32,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:32,121 INFO L82 PathProgramCache]: Analyzing trace with hash -433253711, now seen corresponding path program 86 times [2019-09-08 01:13:32,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:32,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:32,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:32,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:32,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 25671 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2019-09-08 01:13:35,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:35,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:35,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:13:35,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:13:35,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:35,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-08 01:13:35,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:35,657 INFO L134 CoverageAnalysis]: Checked inductivity of 25671 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2019-09-08 01:13:35,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:35,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-08 01:13:35,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-08 01:13:35,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-08 01:13:35,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:13:35,664 INFO L87 Difference]: Start difference. First operand 443 states and 614 transitions. Second operand 89 states. [2019-09-08 01:13:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:37,239 INFO L93 Difference]: Finished difference Result 457 states and 632 transitions. [2019-09-08 01:13:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 01:13:37,239 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 612 [2019-09-08 01:13:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:37,242 INFO L225 Difference]: With dead ends: 457 [2019-09-08 01:13:37,242 INFO L226 Difference]: Without dead ends: 452 [2019-09-08 01:13:37,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:13:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-08 01:13:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 448. [2019-09-08 01:13:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-08 01:13:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 621 transitions. [2019-09-08 01:13:37,252 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 621 transitions. Word has length 612 [2019-09-08 01:13:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:37,252 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 621 transitions. [2019-09-08 01:13:37,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-08 01:13:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 621 transitions. [2019-09-08 01:13:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2019-09-08 01:13:37,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:37,256 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:37,256 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:37,257 INFO L82 PathProgramCache]: Analyzing trace with hash -895946598, now seen corresponding path program 87 times [2019-09-08 01:13:37,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:37,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:37,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 26274 backedges. 0 proven. 18792 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2019-09-08 01:13:40,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:40,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:40,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:13:40,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-09-08 01:13:40,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:40,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-08 01:13:40,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 26274 backedges. 0 proven. 18792 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2019-09-08 01:13:41,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:41,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-09-08 01:13:41,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-08 01:13:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-08 01:13:41,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:13:41,105 INFO L87 Difference]: Start difference. First operand 448 states and 621 transitions. Second operand 90 states. [2019-09-08 01:13:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:42,943 INFO L93 Difference]: Finished difference Result 462 states and 639 transitions. [2019-09-08 01:13:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-08 01:13:42,943 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 619 [2019-09-08 01:13:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:42,947 INFO L225 Difference]: With dead ends: 462 [2019-09-08 01:13:42,947 INFO L226 Difference]: Without dead ends: 457 [2019-09-08 01:13:42,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:13:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-08 01:13:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 453. [2019-09-08 01:13:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-09-08 01:13:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 628 transitions. [2019-09-08 01:13:42,956 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 628 transitions. Word has length 619 [2019-09-08 01:13:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:42,957 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 628 transitions. [2019-09-08 01:13:42,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-08 01:13:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 628 transitions. [2019-09-08 01:13:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-09-08 01:13:42,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:42,961 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 88, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:42,961 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:42,962 INFO L82 PathProgramCache]: Analyzing trace with hash 394021521, now seen corresponding path program 88 times [2019-09-08 01:13:42,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:42,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:42,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:42,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:42,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 26884 backedges. 0 proven. 19228 refuted. 0 times theorem prover too weak. 7656 trivial. 0 not checked. [2019-09-08 01:13:45,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:45,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:46,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:13:46,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:13:46,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:46,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-08 01:13:46,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 26884 backedges. 0 proven. 19228 refuted. 0 times theorem prover too weak. 7656 trivial. 0 not checked. [2019-09-08 01:13:46,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:46,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-08 01:13:46,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-08 01:13:46,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-08 01:13:46,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:13:46,450 INFO L87 Difference]: Start difference. First operand 453 states and 628 transitions. Second operand 91 states. [2019-09-08 01:13:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:47,724 INFO L93 Difference]: Finished difference Result 467 states and 646 transitions. [2019-09-08 01:13:47,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-08 01:13:47,725 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 626 [2019-09-08 01:13:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:47,728 INFO L225 Difference]: With dead ends: 467 [2019-09-08 01:13:47,728 INFO L226 Difference]: Without dead ends: 462 [2019-09-08 01:13:47,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:13:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-08 01:13:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 458. [2019-09-08 01:13:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-09-08 01:13:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 635 transitions. [2019-09-08 01:13:47,739 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 635 transitions. Word has length 626 [2019-09-08 01:13:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:47,740 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 635 transitions. [2019-09-08 01:13:47,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-08 01:13:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 635 transitions. [2019-09-08 01:13:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2019-09-08 01:13:47,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:47,746 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 89, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:47,746 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:47,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1743446854, now seen corresponding path program 89 times [2019-09-08 01:13:47,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:47,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:47,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:47,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:47,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 27501 backedges. 0 proven. 19669 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2019-09-08 01:13:50,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:50,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:50,884 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:13:51,295 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-09-08 01:13:51,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:51,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-08 01:13:51,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 27501 backedges. 0 proven. 19669 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2019-09-08 01:13:51,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:51,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-09-08 01:13:51,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-08 01:13:51,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-08 01:13:51,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 01:13:51,547 INFO L87 Difference]: Start difference. First operand 458 states and 635 transitions. Second operand 92 states. [2019-09-08 01:13:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:53,736 INFO L93 Difference]: Finished difference Result 472 states and 653 transitions. [2019-09-08 01:13:53,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-08 01:13:53,736 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 633 [2019-09-08 01:13:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:53,739 INFO L225 Difference]: With dead ends: 472 [2019-09-08 01:13:53,739 INFO L226 Difference]: Without dead ends: 467 [2019-09-08 01:13:53,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 634 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 01:13:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-08 01:13:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2019-09-08 01:13:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-08 01:13:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 642 transitions. [2019-09-08 01:13:53,748 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 642 transitions. Word has length 633 [2019-09-08 01:13:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:53,749 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 642 transitions. [2019-09-08 01:13:53,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-08 01:13:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 642 transitions. [2019-09-08 01:13:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2019-09-08 01:13:53,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:53,755 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:53,756 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:53,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:53,756 INFO L82 PathProgramCache]: Analyzing trace with hash 375143025, now seen corresponding path program 90 times [2019-09-08 01:13:53,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:53,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 28125 backedges. 0 proven. 20115 refuted. 0 times theorem prover too weak. 8010 trivial. 0 not checked. [2019-09-08 01:13:57,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:57,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:57,047 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:13:57,458 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-09-08 01:13:57,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:57,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-08 01:13:57,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 28125 backedges. 0 proven. 20115 refuted. 0 times theorem prover too weak. 8010 trivial. 0 not checked. [2019-09-08 01:13:57,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:57,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-08 01:13:57,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-08 01:13:57,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-08 01:13:57,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 01:13:57,785 INFO L87 Difference]: Start difference. First operand 463 states and 642 transitions. Second operand 93 states. [2019-09-08 01:13:59,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:59,445 INFO L93 Difference]: Finished difference Result 477 states and 660 transitions. [2019-09-08 01:13:59,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-08 01:13:59,446 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 640 [2019-09-08 01:13:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:59,448 INFO L225 Difference]: With dead ends: 477 [2019-09-08 01:13:59,448 INFO L226 Difference]: Without dead ends: 472 [2019-09-08 01:13:59,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 01:13:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-08 01:13:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 468. [2019-09-08 01:13:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-09-08 01:13:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 649 transitions. [2019-09-08 01:13:59,459 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 649 transitions. Word has length 640 [2019-09-08 01:13:59,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:59,460 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 649 transitions. [2019-09-08 01:13:59,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-08 01:13:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 649 transitions. [2019-09-08 01:13:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-09-08 01:13:59,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:59,464 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 91, 91, 91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:59,464 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash 239177946, now seen corresponding path program 91 times [2019-09-08 01:13:59,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:59,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:59,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:59,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:59,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 28756 backedges. 0 proven. 20566 refuted. 0 times theorem prover too weak. 8190 trivial. 0 not checked. [2019-09-08 01:14:02,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:02,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:02,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:03,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 1660 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-08 01:14:03,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 28756 backedges. 0 proven. 20566 refuted. 0 times theorem prover too weak. 8190 trivial. 0 not checked. [2019-09-08 01:14:03,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:03,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-08 01:14:03,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-08 01:14:03,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-08 01:14:03,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:14:03,328 INFO L87 Difference]: Start difference. First operand 468 states and 649 transitions. Second operand 94 states. [2019-09-08 01:14:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:05,614 INFO L93 Difference]: Finished difference Result 482 states and 667 transitions. [2019-09-08 01:14:05,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-08 01:14:05,615 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 647 [2019-09-08 01:14:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:05,617 INFO L225 Difference]: With dead ends: 482 [2019-09-08 01:14:05,617 INFO L226 Difference]: Without dead ends: 477 [2019-09-08 01:14:05,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:14:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-08 01:14:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 473. [2019-09-08 01:14:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-09-08 01:14:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 656 transitions. [2019-09-08 01:14:05,627 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 656 transitions. Word has length 647 [2019-09-08 01:14:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:05,628 INFO L475 AbstractCegarLoop]: Abstraction has 473 states and 656 transitions. [2019-09-08 01:14:05,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-08 01:14:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 656 transitions. [2019-09-08 01:14:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2019-09-08 01:14:05,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:05,634 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 92, 92, 92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:05,634 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:05,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1691688367, now seen corresponding path program 92 times [2019-09-08 01:14:05,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:05,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:05,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 29394 backedges. 0 proven. 21022 refuted. 0 times theorem prover too weak. 8372 trivial. 0 not checked. [2019-09-08 01:14:09,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:09,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:09,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:09,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:09,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:09,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-08 01:14:09,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 29394 backedges. 0 proven. 21022 refuted. 0 times theorem prover too weak. 8372 trivial. 0 not checked. [2019-09-08 01:14:09,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:09,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-08 01:14:09,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-08 01:14:09,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-08 01:14:09,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:14:09,518 INFO L87 Difference]: Start difference. First operand 473 states and 656 transitions. Second operand 95 states. [2019-09-08 01:14:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:11,468 INFO L93 Difference]: Finished difference Result 487 states and 674 transitions. [2019-09-08 01:14:11,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 01:14:11,469 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 654 [2019-09-08 01:14:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:11,473 INFO L225 Difference]: With dead ends: 487 [2019-09-08 01:14:11,473 INFO L226 Difference]: Without dead ends: 482 [2019-09-08 01:14:11,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:14:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-08 01:14:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2019-09-08 01:14:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-09-08 01:14:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 663 transitions. [2019-09-08 01:14:11,482 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 663 transitions. Word has length 654 [2019-09-08 01:14:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:11,483 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 663 transitions. [2019-09-08 01:14:11,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-08 01:14:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 663 transitions. [2019-09-08 01:14:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-09-08 01:14:11,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:11,487 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 93, 93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:11,487 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:11,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:11,487 INFO L82 PathProgramCache]: Analyzing trace with hash -285192966, now seen corresponding path program 93 times [2019-09-08 01:14:11,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:11,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:11,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:11,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:11,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30039 backedges. 0 proven. 21483 refuted. 0 times theorem prover too weak. 8556 trivial. 0 not checked. [2019-09-08 01:14:14,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:14,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:14,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:14:15,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-09-08 01:14:15,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:15,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-08 01:14:15,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 30039 backedges. 0 proven. 21483 refuted. 0 times theorem prover too weak. 8556 trivial. 0 not checked. [2019-09-08 01:14:15,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:15,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-08 01:14:15,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-08 01:14:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-08 01:14:15,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 01:14:15,663 INFO L87 Difference]: Start difference. First operand 478 states and 663 transitions. Second operand 96 states. [2019-09-08 01:14:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:17,794 INFO L93 Difference]: Finished difference Result 492 states and 681 transitions. [2019-09-08 01:14:17,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-08 01:14:17,794 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 661 [2019-09-08 01:14:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:17,798 INFO L225 Difference]: With dead ends: 492 [2019-09-08 01:14:17,799 INFO L226 Difference]: Without dead ends: 487 [2019-09-08 01:14:17,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 01:14:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-08 01:14:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 483. [2019-09-08 01:14:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-08 01:14:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 670 transitions. [2019-09-08 01:14:17,807 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 670 transitions. Word has length 661 [2019-09-08 01:14:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:17,808 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 670 transitions. [2019-09-08 01:14:17,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-08 01:14:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 670 transitions. [2019-09-08 01:14:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-09-08 01:14:17,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:17,812 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:17,812 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1640383025, now seen corresponding path program 94 times [2019-09-08 01:14:17,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:17,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:17,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:17,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:17,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 30691 backedges. 0 proven. 21949 refuted. 0 times theorem prover too weak. 8742 trivial. 0 not checked. [2019-09-08 01:14:21,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:21,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:21,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:14:21,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:14:21,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:21,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 1714 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-08 01:14:21,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30691 backedges. 0 proven. 21949 refuted. 0 times theorem prover too weak. 8742 trivial. 0 not checked. [2019-09-08 01:14:21,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:21,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-08 01:14:21,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-08 01:14:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-08 01:14:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:14:21,865 INFO L87 Difference]: Start difference. First operand 483 states and 670 transitions. Second operand 97 states. [2019-09-08 01:14:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:23,881 INFO L93 Difference]: Finished difference Result 497 states and 688 transitions. [2019-09-08 01:14:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-08 01:14:23,882 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 668 [2019-09-08 01:14:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:23,885 INFO L225 Difference]: With dead ends: 497 [2019-09-08 01:14:23,885 INFO L226 Difference]: Without dead ends: 492 [2019-09-08 01:14:23,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:14:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-09-08 01:14:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 488. [2019-09-08 01:14:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 01:14:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 677 transitions. [2019-09-08 01:14:23,894 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 677 transitions. Word has length 668 [2019-09-08 01:14:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:23,895 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 677 transitions. [2019-09-08 01:14:23,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-08 01:14:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 677 transitions. [2019-09-08 01:14:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-09-08 01:14:23,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:23,899 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 95, 95, 95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:23,899 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:23,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:23,899 INFO L82 PathProgramCache]: Analyzing trace with hash 145969434, now seen corresponding path program 95 times [2019-09-08 01:14:23,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:23,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:23,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:23,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:23,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 31350 backedges. 0 proven. 22420 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2019-09-08 01:14:27,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:27,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:27,417 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:14:27,866 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-09-08 01:14:27,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:27,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 1732 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-08 01:14:27,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 31350 backedges. 0 proven. 22420 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2019-09-08 01:14:28,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:28,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-08 01:14:28,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-08 01:14:28,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-08 01:14:28,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:14:28,155 INFO L87 Difference]: Start difference. First operand 488 states and 677 transitions. Second operand 98 states. [2019-09-08 01:14:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:30,413 INFO L93 Difference]: Finished difference Result 502 states and 695 transitions. [2019-09-08 01:14:30,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-08 01:14:30,414 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 675 [2019-09-08 01:14:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:30,417 INFO L225 Difference]: With dead ends: 502 [2019-09-08 01:14:30,417 INFO L226 Difference]: Without dead ends: 497 [2019-09-08 01:14:30,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:14:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-08 01:14:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 493. [2019-09-08 01:14:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-08 01:14:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 684 transitions. [2019-09-08 01:14:30,427 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 684 transitions. Word has length 675 [2019-09-08 01:14:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:30,427 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 684 transitions. [2019-09-08 01:14:30,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-08 01:14:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 684 transitions. [2019-09-08 01:14:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2019-09-08 01:14:30,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:30,432 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 96, 96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:30,432 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:30,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:30,432 INFO L82 PathProgramCache]: Analyzing trace with hash 160193041, now seen corresponding path program 96 times [2019-09-08 01:14:30,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:30,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:30,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:30,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:30,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 32016 backedges. 0 proven. 22896 refuted. 0 times theorem prover too weak. 9120 trivial. 0 not checked. [2019-09-08 01:14:34,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:34,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:34,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:14:34,568 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-09-08 01:14:34,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:34,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1750 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-08 01:14:34,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 32016 backedges. 0 proven. 22896 refuted. 0 times theorem prover too weak. 9120 trivial. 0 not checked. [2019-09-08 01:14:34,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:34,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-08 01:14:34,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-08 01:14:34,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-08 01:14:34,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:14:34,824 INFO L87 Difference]: Start difference. First operand 493 states and 684 transitions. Second operand 99 states. [2019-09-08 01:14:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:37,054 INFO L93 Difference]: Finished difference Result 507 states and 702 transitions. [2019-09-08 01:14:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-08 01:14:37,055 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 682 [2019-09-08 01:14:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:37,057 INFO L225 Difference]: With dead ends: 507 [2019-09-08 01:14:37,058 INFO L226 Difference]: Without dead ends: 502 [2019-09-08 01:14:37,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:14:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-08 01:14:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 498. [2019-09-08 01:14:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-09-08 01:14:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 691 transitions. [2019-09-08 01:14:37,068 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 691 transitions. Word has length 682 [2019-09-08 01:14:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:37,068 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 691 transitions. [2019-09-08 01:14:37,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-08 01:14:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 691 transitions. [2019-09-08 01:14:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-09-08 01:14:37,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:37,072 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 97, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:37,073 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:37,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1446812986, now seen corresponding path program 97 times [2019-09-08 01:14:37,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:37,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:37,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 32689 backedges. 0 proven. 23377 refuted. 0 times theorem prover too weak. 9312 trivial. 0 not checked. [2019-09-08 01:14:40,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:40,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:40,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:41,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 1768 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-08 01:14:41,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 32689 backedges. 0 proven. 23377 refuted. 0 times theorem prover too weak. 9312 trivial. 0 not checked. [2019-09-08 01:14:41,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:41,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-08 01:14:41,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-08 01:14:41,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-08 01:14:41,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:14:41,410 INFO L87 Difference]: Start difference. First operand 498 states and 691 transitions. Second operand 100 states. [2019-09-08 01:14:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:43,655 INFO L93 Difference]: Finished difference Result 512 states and 709 transitions. [2019-09-08 01:14:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-08 01:14:43,655 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 689 [2019-09-08 01:14:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:43,658 INFO L225 Difference]: With dead ends: 512 [2019-09-08 01:14:43,658 INFO L226 Difference]: Without dead ends: 507 [2019-09-08 01:14:43,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:14:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-08 01:14:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2019-09-08 01:14:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-08 01:14:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 698 transitions. [2019-09-08 01:14:43,668 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 698 transitions. Word has length 689 [2019-09-08 01:14:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:43,668 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 698 transitions. [2019-09-08 01:14:43,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-08 01:14:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 698 transitions. [2019-09-08 01:14:43,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-09-08 01:14:43,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:43,675 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:43,675 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:43,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:43,676 INFO L82 PathProgramCache]: Analyzing trace with hash -178574863, now seen corresponding path program 98 times [2019-09-08 01:14:43,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:43,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:43,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:43,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:43,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 33369 backedges. 0 proven. 23863 refuted. 0 times theorem prover too weak. 9506 trivial. 0 not checked. [2019-09-08 01:14:47,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:47,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:47,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:47,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:47,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:47,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-08 01:14:47,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 33369 backedges. 0 proven. 23863 refuted. 0 times theorem prover too weak. 9506 trivial. 0 not checked. [2019-09-08 01:14:48,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:48,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-08 01:14:48,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-08 01:14:48,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-08 01:14:48,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:14:48,090 INFO L87 Difference]: Start difference. First operand 503 states and 698 transitions. Second operand 101 states. [2019-09-08 01:14:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:50,557 INFO L93 Difference]: Finished difference Result 517 states and 716 transitions. [2019-09-08 01:14:50,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 01:14:50,558 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 696 [2019-09-08 01:14:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:50,560 INFO L225 Difference]: With dead ends: 517 [2019-09-08 01:14:50,561 INFO L226 Difference]: Without dead ends: 512 [2019-09-08 01:14:50,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:14:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-08 01:14:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 508. [2019-09-08 01:14:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-09-08 01:14:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 705 transitions. [2019-09-08 01:14:50,571 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 705 transitions. Word has length 696 [2019-09-08 01:14:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:50,571 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 705 transitions. [2019-09-08 01:14:50,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-08 01:14:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 705 transitions. [2019-09-08 01:14:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-09-08 01:14:50,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:50,577 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 99, 99, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:50,578 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:50,578 INFO L82 PathProgramCache]: Analyzing trace with hash 519975258, now seen corresponding path program 99 times [2019-09-08 01:14:50,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:50,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:50,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:50,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:50,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 34056 backedges. 0 proven. 24354 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-08 01:14:54,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:54,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:54,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:14:54,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-09-08 01:14:54,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:54,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-08 01:14:54,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 34056 backedges. 0 proven. 24354 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-08 01:14:55,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:55,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-08 01:14:55,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-08 01:14:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-08 01:14:55,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 01:14:55,184 INFO L87 Difference]: Start difference. First operand 508 states and 705 transitions. Second operand 102 states. [2019-09-08 01:14:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:57,578 INFO L93 Difference]: Finished difference Result 522 states and 723 transitions. [2019-09-08 01:14:57,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-08 01:14:57,578 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 703 [2019-09-08 01:14:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:57,580 INFO L225 Difference]: With dead ends: 522 [2019-09-08 01:14:57,581 INFO L226 Difference]: Without dead ends: 517 [2019-09-08 01:14:57,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 01:14:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-08 01:14:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 513. [2019-09-08 01:14:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-09-08 01:14:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 712 transitions. [2019-09-08 01:14:57,591 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 712 transitions. Word has length 703 [2019-09-08 01:14:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:57,592 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 712 transitions. [2019-09-08 01:14:57,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-08 01:14:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 712 transitions. [2019-09-08 01:14:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2019-09-08 01:14:57,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:57,598 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:57,598 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 730902993, now seen corresponding path program 100 times [2019-09-08 01:14:57,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:57,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:57,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 34750 backedges. 0 proven. 24850 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-08 01:15:01,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:01,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:15:01,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:15:01,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:15:01,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:01,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 1822 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-08 01:15:01,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 34750 backedges. 0 proven. 24850 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-08 01:15:02,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:02,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2019-09-08 01:15:02,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-08 01:15:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-08 01:15:02,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 01:15:02,111 INFO L87 Difference]: Start difference. First operand 513 states and 712 transitions. Second operand 103 states. [2019-09-08 01:15:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:04,101 INFO L93 Difference]: Finished difference Result 527 states and 730 transitions. [2019-09-08 01:15:04,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-08 01:15:04,102 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 710 [2019-09-08 01:15:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:04,105 INFO L225 Difference]: With dead ends: 527 [2019-09-08 01:15:04,105 INFO L226 Difference]: Without dead ends: 522 [2019-09-08 01:15:04,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 01:15:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-08 01:15:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 518. [2019-09-08 01:15:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-09-08 01:15:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 719 transitions. [2019-09-08 01:15:04,119 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 719 transitions. Word has length 710 [2019-09-08 01:15:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:04,119 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 719 transitions. [2019-09-08 01:15:04,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-08 01:15:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 719 transitions. [2019-09-08 01:15:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-09-08 01:15:04,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:04,125 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 101, 101, 101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:04,125 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash 383389050, now seen corresponding path program 101 times [2019-09-08 01:15:04,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:04,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:04,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:04,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:04,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:08,070 INFO L134 CoverageAnalysis]: Checked inductivity of 35451 backedges. 0 proven. 25351 refuted. 0 times theorem prover too weak. 10100 trivial. 0 not checked. [2019-09-08 01:15:08,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:08,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:15:08,081 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:15:08,533 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2019-09-08 01:15:08,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:08,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1840 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-08 01:15:08,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:08,832 INFO L134 CoverageAnalysis]: Checked inductivity of 35451 backedges. 0 proven. 25351 refuted. 0 times theorem prover too weak. 10100 trivial. 0 not checked. [2019-09-08 01:15:08,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:08,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2019-09-08 01:15:08,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-08 01:15:08,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-08 01:15:08,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-08 01:15:08,840 INFO L87 Difference]: Start difference. First operand 518 states and 719 transitions. Second operand 104 states. [2019-09-08 01:15:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:11,718 INFO L93 Difference]: Finished difference Result 532 states and 737 transitions. [2019-09-08 01:15:11,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-08 01:15:11,719 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 717 [2019-09-08 01:15:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:11,720 INFO L225 Difference]: With dead ends: 532 [2019-09-08 01:15:11,720 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 01:15:11,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-08 01:15:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 01:15:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2019-09-08 01:15:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-09-08 01:15:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 726 transitions. [2019-09-08 01:15:11,729 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 726 transitions. Word has length 717 [2019-09-08 01:15:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:11,730 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 726 transitions. [2019-09-08 01:15:11,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-08 01:15:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 726 transitions. [2019-09-08 01:15:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2019-09-08 01:15:11,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:11,735 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 102, 102, 102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:11,735 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 906686897, now seen corresponding path program 102 times [2019-09-08 01:15:11,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:11,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:11,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36159 backedges. 0 proven. 25857 refuted. 0 times theorem prover too weak. 10302 trivial. 0 not checked. [2019-09-08 01:15:15,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:15,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:15:15,678 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:15:16,156 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2019-09-08 01:15:16,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:16,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-08 01:15:16,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 36159 backedges. 0 proven. 25857 refuted. 0 times theorem prover too weak. 10302 trivial. 0 not checked. [2019-09-08 01:15:16,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:16,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2019-09-08 01:15:16,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-08 01:15:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-08 01:15:16,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-09-08 01:15:16,431 INFO L87 Difference]: Start difference. First operand 523 states and 726 transitions. Second operand 105 states. [2019-09-08 01:15:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:18,134 INFO L93 Difference]: Finished difference Result 537 states and 744 transitions. [2019-09-08 01:15:18,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-08 01:15:18,134 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 724 [2019-09-08 01:15:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:18,136 INFO L225 Difference]: With dead ends: 537 [2019-09-08 01:15:18,136 INFO L226 Difference]: Without dead ends: 532 [2019-09-08 01:15:18,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-09-08 01:15:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-09-08 01:15:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 528. [2019-09-08 01:15:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-08 01:15:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 733 transitions. [2019-09-08 01:15:18,145 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 733 transitions. Word has length 724 [2019-09-08 01:15:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:18,146 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 733 transitions. [2019-09-08 01:15:18,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-08 01:15:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 733 transitions. [2019-09-08 01:15:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2019-09-08 01:15:18,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:18,151 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 103, 103, 103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:18,151 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:18,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2117218714, now seen corresponding path program 103 times [2019-09-08 01:15:18,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:18,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:18,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 36874 backedges. 0 proven. 26368 refuted. 0 times theorem prover too weak. 10506 trivial. 0 not checked. [2019-09-08 01:15:22,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:22,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:15:22,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:15:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:22,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 1876 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-08 01:15:22,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36874 backedges. 0 proven. 26368 refuted. 0 times theorem prover too weak. 10506 trivial. 0 not checked. [2019-09-08 01:15:22,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:22,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2019-09-08 01:15:22,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-08 01:15:22,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-08 01:15:22,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 01:15:22,898 INFO L87 Difference]: Start difference. First operand 528 states and 733 transitions. Second operand 106 states. [2019-09-08 01:15:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:24,936 INFO L93 Difference]: Finished difference Result 542 states and 751 transitions. [2019-09-08 01:15:24,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-08 01:15:24,937 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 731 [2019-09-08 01:15:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:24,938 INFO L225 Difference]: With dead ends: 542 [2019-09-08 01:15:24,938 INFO L226 Difference]: Without dead ends: 537 [2019-09-08 01:15:24,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 01:15:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-08 01:15:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2019-09-08 01:15:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-09-08 01:15:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 740 transitions. [2019-09-08 01:15:24,947 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 740 transitions. Word has length 731 [2019-09-08 01:15:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:24,948 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 740 transitions. [2019-09-08 01:15:24,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-08 01:15:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 740 transitions. [2019-09-08 01:15:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2019-09-08 01:15:24,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:24,954 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 104, 104, 104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:24,954 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash 36170129, now seen corresponding path program 104 times [2019-09-08 01:15:24,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:24,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:24,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:24,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:15:24,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 37596 backedges. 0 proven. 26884 refuted. 0 times theorem prover too weak. 10712 trivial. 0 not checked. [2019-09-08 01:15:29,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:29,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:15:29,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:15:29,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:15:29,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:29,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 1894 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-08 01:15:29,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 37596 backedges. 0 proven. 26884 refuted. 0 times theorem prover too weak. 10712 trivial. 0 not checked. [2019-09-08 01:15:29,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:29,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2019-09-08 01:15:29,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-08 01:15:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-08 01:15:29,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-08 01:15:29,650 INFO L87 Difference]: Start difference. First operand 533 states and 740 transitions. Second operand 107 states. [2019-09-08 01:15:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:31,423 INFO L93 Difference]: Finished difference Result 547 states and 758 transitions. [2019-09-08 01:15:31,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-08 01:15:31,423 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 738 [2019-09-08 01:15:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:31,424 INFO L225 Difference]: With dead ends: 547 [2019-09-08 01:15:31,425 INFO L226 Difference]: Without dead ends: 542 [2019-09-08 01:15:31,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-08 01:15:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-08 01:15:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 538. [2019-09-08 01:15:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-09-08 01:15:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 747 transitions. [2019-09-08 01:15:31,432 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 747 transitions. Word has length 738 [2019-09-08 01:15:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:31,433 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 747 transitions. [2019-09-08 01:15:31,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-08 01:15:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 747 transitions. [2019-09-08 01:15:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2019-09-08 01:15:31,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:31,439 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 105, 105, 105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:31,439 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:31,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1105763770, now seen corresponding path program 105 times [2019-09-08 01:15:31,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:31,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:31,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:31,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:31,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 38325 backedges. 0 proven. 27405 refuted. 0 times theorem prover too weak. 10920 trivial. 0 not checked. [2019-09-08 01:15:35,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:35,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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:15:35,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:15:36,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2019-09-08 01:15:36,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:36,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-08 01:15:36,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 38325 backedges. 0 proven. 27405 refuted. 0 times theorem prover too weak. 10920 trivial. 0 not checked. [2019-09-08 01:15:36,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:36,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2019-09-08 01:15:36,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-08 01:15:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-08 01:15:36,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-08 01:15:36,577 INFO L87 Difference]: Start difference. First operand 538 states and 747 transitions. Second operand 108 states. [2019-09-08 01:15:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:38,605 INFO L93 Difference]: Finished difference Result 552 states and 765 transitions. [2019-09-08 01:15:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-08 01:15:38,605 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 745 [2019-09-08 01:15:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:38,607 INFO L225 Difference]: With dead ends: 552 [2019-09-08 01:15:38,607 INFO L226 Difference]: Without dead ends: 547 [2019-09-08 01:15:38,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-08 01:15:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-08 01:15:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 543. [2019-09-08 01:15:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-08 01:15:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 754 transitions. [2019-09-08 01:15:38,618 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 754 transitions. Word has length 745 [2019-09-08 01:15:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:38,619 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 754 transitions. [2019-09-08 01:15:38,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-08 01:15:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 754 transitions. [2019-09-08 01:15:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2019-09-08 01:15:38,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:38,626 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 106, 106, 106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:38,626 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1060791951, now seen corresponding path program 106 times [2019-09-08 01:15:38,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:38,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:38,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 39061 backedges. 0 proven. 27931 refuted. 0 times theorem prover too weak. 11130 trivial. 0 not checked. [2019-09-08 01:15:43,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:43,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:15:43,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:15:43,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:15:43,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:43,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-08 01:15:43,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 39061 backedges. 0 proven. 27931 refuted. 0 times theorem prover too weak. 11130 trivial. 0 not checked. [2019-09-08 01:15:43,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:43,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2019-09-08 01:15:43,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-08 01:15:43,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-08 01:15:43,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 01:15:43,649 INFO L87 Difference]: Start difference. First operand 543 states and 754 transitions. Second operand 109 states. [2019-09-08 01:15:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:45,956 INFO L93 Difference]: Finished difference Result 557 states and 772 transitions. [2019-09-08 01:15:45,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-08 01:15:45,956 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 752 [2019-09-08 01:15:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:45,958 INFO L225 Difference]: With dead ends: 557 [2019-09-08 01:15:45,958 INFO L226 Difference]: Without dead ends: 552 [2019-09-08 01:15:45,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 753 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 01:15:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-08 01:15:45,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 548. [2019-09-08 01:15:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-09-08 01:15:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 761 transitions. [2019-09-08 01:15:45,969 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 761 transitions. Word has length 752 [2019-09-08 01:15:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:45,970 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 761 transitions. [2019-09-08 01:15:45,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-08 01:15:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 761 transitions. [2019-09-08 01:15:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2019-09-08 01:15:45,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:45,976 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 107, 107, 107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:45,977 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash 459231706, now seen corresponding path program 107 times [2019-09-08 01:15:45,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:45,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:45,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 39804 backedges. 0 proven. 28462 refuted. 0 times theorem prover too weak. 11342 trivial. 0 not checked. [2019-09-08 01:15:50,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:50,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:15:50,347 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:15:50,870 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2019-09-08 01:15:50,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:50,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1948 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-08 01:15:50,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 39804 backedges. 0 proven. 28462 refuted. 0 times theorem prover too weak. 11342 trivial. 0 not checked. [2019-09-08 01:15:51,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:51,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2019-09-08 01:15:51,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-08 01:15:51,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-08 01:15:51,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 01:15:51,225 INFO L87 Difference]: Start difference. First operand 548 states and 761 transitions. Second operand 110 states. [2019-09-08 01:15:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:52,793 INFO L93 Difference]: Finished difference Result 562 states and 779 transitions. [2019-09-08 01:15:52,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-08 01:15:52,794 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 759 [2019-09-08 01:15:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:52,796 INFO L225 Difference]: With dead ends: 562 [2019-09-08 01:15:52,796 INFO L226 Difference]: Without dead ends: 557 [2019-09-08 01:15:52,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 01:15:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-08 01:15:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2019-09-08 01:15:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-09-08 01:15:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 768 transitions. [2019-09-08 01:15:52,807 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 768 transitions. Word has length 759 [2019-09-08 01:15:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:52,808 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 768 transitions. [2019-09-08 01:15:52,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-08 01:15:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 768 transitions. [2019-09-08 01:15:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2019-09-08 01:15:52,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:52,814 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 108, 108, 108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:52,814 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:52,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:52,815 INFO L82 PathProgramCache]: Analyzing trace with hash -968752815, now seen corresponding path program 108 times [2019-09-08 01:15:52,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:52,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:52,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:52,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:52,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 40554 backedges. 0 proven. 28998 refuted. 0 times theorem prover too weak. 11556 trivial. 0 not checked. [2019-09-08 01:15:57,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:57,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:15:57,343 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:15:57,875 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2019-09-08 01:15:57,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:57,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-08 01:15:57,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 40554 backedges. 0 proven. 28998 refuted. 0 times theorem prover too weak. 11556 trivial. 0 not checked. [2019-09-08 01:15:58,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:58,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2019-09-08 01:15:58,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-08 01:15:58,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-08 01:15:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-09-08 01:15:58,218 INFO L87 Difference]: Start difference. First operand 553 states and 768 transitions. Second operand 111 states. [2019-09-08 01:16:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:00,309 INFO L93 Difference]: Finished difference Result 567 states and 786 transitions. [2019-09-08 01:16:00,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-08 01:16:00,309 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 766 [2019-09-08 01:16:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:00,311 INFO L225 Difference]: With dead ends: 567 [2019-09-08 01:16:00,311 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 01:16:00,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-09-08 01:16:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 01:16:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 558. [2019-09-08 01:16:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-08 01:16:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 775 transitions. [2019-09-08 01:16:00,318 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 775 transitions. Word has length 766 [2019-09-08 01:16:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:00,318 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 775 transitions. [2019-09-08 01:16:00,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-08 01:16:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 775 transitions. [2019-09-08 01:16:00,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2019-09-08 01:16:00,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:00,322 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 109, 109, 109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:00,323 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:00,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:00,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1334292998, now seen corresponding path program 109 times [2019-09-08 01:16:00,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:00,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:00,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:00,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:00,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 41311 backedges. 0 proven. 29539 refuted. 0 times theorem prover too weak. 11772 trivial. 0 not checked. [2019-09-08 01:16:04,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:04,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:05,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:05,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 1984 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-08 01:16:05,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 41311 backedges. 0 proven. 29539 refuted. 0 times theorem prover too weak. 11772 trivial. 0 not checked. [2019-09-08 01:16:05,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:05,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2019-09-08 01:16:05,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-08 01:16:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-08 01:16:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-08 01:16:05,587 INFO L87 Difference]: Start difference. First operand 558 states and 775 transitions. Second operand 112 states. [2019-09-08 01:16:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:07,184 INFO L93 Difference]: Finished difference Result 572 states and 793 transitions. [2019-09-08 01:16:07,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-08 01:16:07,185 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 773 [2019-09-08 01:16:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:07,187 INFO L225 Difference]: With dead ends: 572 [2019-09-08 01:16:07,187 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 01:16:07,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 774 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-08 01:16:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 01:16:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 563. [2019-09-08 01:16:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-08 01:16:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 782 transitions. [2019-09-08 01:16:07,199 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 782 transitions. Word has length 773 [2019-09-08 01:16:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:07,200 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 782 transitions. [2019-09-08 01:16:07,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-08 01:16:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 782 transitions. [2019-09-08 01:16:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-09-08 01:16:07,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:07,207 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 110, 110, 110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:07,207 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:07,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:07,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1786454321, now seen corresponding path program 110 times [2019-09-08 01:16:07,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:07,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:07,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:07,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:07,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 42075 backedges. 0 proven. 30085 refuted. 0 times theorem prover too weak. 11990 trivial. 0 not checked. [2019-09-08 01:16:12,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:12,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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:12,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:12,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:12,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:12,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 2002 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-08 01:16:12,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 42075 backedges. 0 proven. 30085 refuted. 0 times theorem prover too weak. 11990 trivial. 0 not checked. [2019-09-08 01:16:12,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:12,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2019-09-08 01:16:12,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-08 01:16:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-08 01:16:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-08 01:16:12,796 INFO L87 Difference]: Start difference. First operand 563 states and 782 transitions. Second operand 113 states. [2019-09-08 01:16:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:15,325 INFO L93 Difference]: Finished difference Result 577 states and 800 transitions. [2019-09-08 01:16:15,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-08 01:16:15,325 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 780 [2019-09-08 01:16:15,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:15,328 INFO L225 Difference]: With dead ends: 577 [2019-09-08 01:16:15,328 INFO L226 Difference]: Without dead ends: 572 [2019-09-08 01:16:15,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 781 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-08 01:16:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-08 01:16:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 568. [2019-09-08 01:16:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 01:16:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 789 transitions. [2019-09-08 01:16:15,341 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 789 transitions. Word has length 780 [2019-09-08 01:16:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:15,341 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 789 transitions. [2019-09-08 01:16:15,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-08 01:16:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 789 transitions. [2019-09-08 01:16:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2019-09-08 01:16:15,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:15,349 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 111, 111, 111, 111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:15,350 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1282043366, now seen corresponding path program 111 times [2019-09-08 01:16:15,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:15,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:15,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 42846 backedges. 0 proven. 30636 refuted. 0 times theorem prover too weak. 12210 trivial. 0 not checked. [2019-09-08 01:16:20,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:20,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:20,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:20,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2019-09-08 01:16:20,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:20,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-08 01:16:20,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 42846 backedges. 0 proven. 30636 refuted. 0 times theorem prover too weak. 12210 trivial. 0 not checked. [2019-09-08 01:16:21,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:21,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2019-09-08 01:16:21,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-08 01:16:21,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-08 01:16:21,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-08 01:16:21,331 INFO L87 Difference]: Start difference. First operand 568 states and 789 transitions. Second operand 114 states. [2019-09-08 01:16:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:23,437 INFO L93 Difference]: Finished difference Result 582 states and 807 transitions. [2019-09-08 01:16:23,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-08 01:16:23,438 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 787 [2019-09-08 01:16:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:23,439 INFO L225 Difference]: With dead ends: 582 [2019-09-08 01:16:23,439 INFO L226 Difference]: Without dead ends: 577 [2019-09-08 01:16:23,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-08 01:16:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-08 01:16:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 573. [2019-09-08 01:16:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-08 01:16:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 796 transitions. [2019-09-08 01:16:23,447 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 796 transitions. Word has length 787 [2019-09-08 01:16:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:23,448 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 796 transitions. [2019-09-08 01:16:23,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-08 01:16:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 796 transitions. [2019-09-08 01:16:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2019-09-08 01:16:23,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:23,453 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 112, 112, 112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:23,454 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash -389089007, now seen corresponding path program 112 times [2019-09-08 01:16:23,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:23,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:23,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:23,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:23,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 43624 backedges. 0 proven. 31192 refuted. 0 times theorem prover too weak. 12432 trivial. 0 not checked. [2019-09-08 01:16:28,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:28,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:28,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:28,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:28,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:28,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 2038 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-08 01:16:28,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 43624 backedges. 0 proven. 31192 refuted. 0 times theorem prover too weak. 12432 trivial. 0 not checked. [2019-09-08 01:16:29,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:29,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2019-09-08 01:16:29,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-08 01:16:29,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-08 01:16:29,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 01:16:29,062 INFO L87 Difference]: Start difference. First operand 573 states and 796 transitions. Second operand 115 states. [2019-09-08 01:16:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:31,326 INFO L93 Difference]: Finished difference Result 587 states and 814 transitions. [2019-09-08 01:16:31,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-08 01:16:31,327 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 794 [2019-09-08 01:16:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:31,329 INFO L225 Difference]: With dead ends: 587 [2019-09-08 01:16:31,329 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 01:16:31,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 01:16:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 01:16:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 578. [2019-09-08 01:16:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-08 01:16:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 803 transitions. [2019-09-08 01:16:31,342 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 803 transitions. Word has length 794 [2019-09-08 01:16:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:31,343 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 803 transitions. [2019-09-08 01:16:31,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-08 01:16:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 803 transitions. [2019-09-08 01:16:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2019-09-08 01:16:31,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:31,353 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 113, 113, 113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:31,354 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:31,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:31,354 INFO L82 PathProgramCache]: Analyzing trace with hash 60366394, now seen corresponding path program 113 times [2019-09-08 01:16:31,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:31,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:31,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:31,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:31,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 44409 backedges. 0 proven. 31753 refuted. 0 times theorem prover too weak. 12656 trivial. 0 not checked. [2019-09-08 01:16:36,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:36,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:36,663 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:37,256 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2019-09-08 01:16:37,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:37,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 2056 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-08 01:16:37,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 44409 backedges. 0 proven. 31753 refuted. 0 times theorem prover too weak. 12656 trivial. 0 not checked. [2019-09-08 01:16:37,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:37,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2019-09-08 01:16:37,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-08 01:16:37,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-08 01:16:37,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-08 01:16:37,618 INFO L87 Difference]: Start difference. First operand 578 states and 803 transitions. Second operand 116 states. [2019-09-08 01:16:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:40,011 INFO L93 Difference]: Finished difference Result 592 states and 821 transitions. [2019-09-08 01:16:40,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-08 01:16:40,011 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 801 [2019-09-08 01:16:40,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:40,014 INFO L225 Difference]: With dead ends: 592 [2019-09-08 01:16:40,014 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 01:16:40,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 916 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-08 01:16:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 01:16:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 583. [2019-09-08 01:16:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 01:16:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 810 transitions. [2019-09-08 01:16:40,027 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 810 transitions. Word has length 801 [2019-09-08 01:16:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:40,028 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 810 transitions. [2019-09-08 01:16:40,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-08 01:16:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 810 transitions. [2019-09-08 01:16:40,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-09-08 01:16:40,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:40,035 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 114, 114, 114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:40,036 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1075546353, now seen corresponding path program 114 times [2019-09-08 01:16:40,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:40,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:40,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:40,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:40,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 45201 backedges. 0 proven. 32319 refuted. 0 times theorem prover too weak. 12882 trivial. 0 not checked. [2019-09-08 01:16:45,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:45,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:45,304 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:16:45,904 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2019-09-08 01:16:45,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:45,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 2074 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-08 01:16:45,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 45201 backedges. 0 proven. 32319 refuted. 0 times theorem prover too weak. 12882 trivial. 0 not checked. [2019-09-08 01:16:46,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:46,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2019-09-08 01:16:46,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-08 01:16:46,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-08 01:16:46,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 01:16:46,513 INFO L87 Difference]: Start difference. First operand 583 states and 810 transitions. Second operand 117 states. [2019-09-08 01:16:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:48,280 INFO L93 Difference]: Finished difference Result 597 states and 828 transitions. [2019-09-08 01:16:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-08 01:16:48,280 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 808 [2019-09-08 01:16:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:48,282 INFO L225 Difference]: With dead ends: 597 [2019-09-08 01:16:48,282 INFO L226 Difference]: Without dead ends: 592 [2019-09-08 01:16:48,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 01:16:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-08 01:16:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2019-09-08 01:16:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-09-08 01:16:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 817 transitions. [2019-09-08 01:16:48,296 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 817 transitions. Word has length 808 [2019-09-08 01:16:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:48,297 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 817 transitions. [2019-09-08 01:16:48,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-08 01:16:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 817 transitions. [2019-09-08 01:16:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2019-09-08 01:16:48,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:48,305 INFO L399 BasicCegarLoop]: trace histogram [115, 115, 115, 115, 115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:48,305 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:48,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash -874188198, now seen corresponding path program 115 times [2019-09-08 01:16:48,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:48,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:48,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:48,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:48,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 46000 backedges. 0 proven. 32890 refuted. 0 times theorem prover too weak. 13110 trivial. 0 not checked. [2019-09-08 01:16:53,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:53,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:53,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:53,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 2092 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-08 01:16:53,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 46000 backedges. 0 proven. 32890 refuted. 0 times theorem prover too weak. 13110 trivial. 0 not checked. [2019-09-08 01:16:54,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:54,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2019-09-08 01:16:54,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-08 01:16:54,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-08 01:16:54,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 01:16:54,255 INFO L87 Difference]: Start difference. First operand 588 states and 817 transitions. Second operand 118 states. [2019-09-08 01:16:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:57,453 INFO L93 Difference]: Finished difference Result 602 states and 835 transitions. [2019-09-08 01:16:57,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-08 01:16:57,453 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 815 [2019-09-08 01:16:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:57,455 INFO L225 Difference]: With dead ends: 602 [2019-09-08 01:16:57,456 INFO L226 Difference]: Without dead ends: 597 [2019-09-08 01:16:57,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 816 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 01:16:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-08 01:16:57,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 593. [2019-09-08 01:16:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-08 01:16:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 824 transitions. [2019-09-08 01:16:57,468 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 824 transitions. Word has length 815 [2019-09-08 01:16:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:57,469 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 824 transitions. [2019-09-08 01:16:57,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-08 01:16:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 824 transitions. [2019-09-08 01:16:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2019-09-08 01:16:57,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:57,477 INFO L399 BasicCegarLoop]: trace histogram [116, 116, 116, 116, 116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:57,477 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:57,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash 314495185, now seen corresponding path program 116 times [2019-09-08 01:16:57,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:57,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:57,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:57,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 46806 backedges. 0 proven. 33466 refuted. 0 times theorem prover too weak. 13340 trivial. 0 not checked. [2019-09-08 01:17:02,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:02,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:02,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:17:03,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:17:03,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:03,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 2110 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-08 01:17:03,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 46806 backedges. 0 proven. 33466 refuted. 0 times theorem prover too weak. 13340 trivial. 0 not checked. [2019-09-08 01:17:03,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:03,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2019-09-08 01:17:03,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-08 01:17:03,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-08 01:17:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-08 01:17:03,459 INFO L87 Difference]: Start difference. First operand 593 states and 824 transitions. Second operand 119 states. [2019-09-08 01:17:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:05,274 INFO L93 Difference]: Finished difference Result 607 states and 842 transitions. [2019-09-08 01:17:05,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-08 01:17:05,274 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 822 [2019-09-08 01:17:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:05,276 INFO L225 Difference]: With dead ends: 607 [2019-09-08 01:17:05,276 INFO L226 Difference]: Without dead ends: 602 [2019-09-08 01:17:05,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 823 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-08 01:17:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-08 01:17:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2019-09-08 01:17:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-08 01:17:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 831 transitions. [2019-09-08 01:17:05,288 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 831 transitions. Word has length 822 [2019-09-08 01:17:05,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:05,289 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 831 transitions. [2019-09-08 01:17:05,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-08 01:17:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 831 transitions. [2019-09-08 01:17:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2019-09-08 01:17:05,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:05,297 INFO L399 BasicCegarLoop]: trace histogram [117, 117, 117, 117, 117, 117, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:05,297 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:05,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1537536390, now seen corresponding path program 117 times [2019-09-08 01:17:05,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:05,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:05,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:05,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:05,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 47619 backedges. 0 proven. 34047 refuted. 0 times theorem prover too weak. 13572 trivial. 0 not checked. [2019-09-08 01:17:10,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:10,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:10,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:17:11,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 118 check-sat command(s) [2019-09-08 01:17:11,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:11,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 2128 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-08 01:17:11,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 47619 backedges. 0 proven. 34047 refuted. 0 times theorem prover too weak. 13572 trivial. 0 not checked. [2019-09-08 01:17:11,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:11,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2019-09-08 01:17:11,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-08 01:17:11,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-08 01:17:11,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-08 01:17:11,752 INFO L87 Difference]: Start difference. First operand 598 states and 831 transitions. Second operand 120 states. [2019-09-08 01:17:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:14,604 INFO L93 Difference]: Finished difference Result 612 states and 849 transitions. [2019-09-08 01:17:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-08 01:17:14,604 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 829 [2019-09-08 01:17:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:14,606 INFO L225 Difference]: With dead ends: 612 [2019-09-08 01:17:14,606 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 01:17:14,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 830 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-08 01:17:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 01:17:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-09-08 01:17:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 01:17:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 838 transitions. [2019-09-08 01:17:14,615 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 838 transitions. Word has length 829 [2019-09-08 01:17:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:14,615 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 838 transitions. [2019-09-08 01:17:14,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-08 01:17:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 838 transitions. [2019-09-08 01:17:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2019-09-08 01:17:14,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:14,621 INFO L399 BasicCegarLoop]: trace histogram [118, 118, 118, 118, 118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:14,621 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:14,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2036936527, now seen corresponding path program 118 times [2019-09-08 01:17:14,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:14,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:14,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:14,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:14,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 48439 backedges. 0 proven. 34633 refuted. 0 times theorem prover too weak. 13806 trivial. 0 not checked. [2019-09-08 01:17:20,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:20,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:20,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:17:20,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:17:20,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:20,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 2146 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-08 01:17:20,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 48439 backedges. 0 proven. 34633 refuted. 0 times theorem prover too weak. 13806 trivial. 0 not checked. [2019-09-08 01:17:20,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:20,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2019-09-08 01:17:20,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-08 01:17:20,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-08 01:17:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-08 01:17:20,769 INFO L87 Difference]: Start difference. First operand 603 states and 838 transitions. Second operand 121 states. [2019-09-08 01:17:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:23,725 INFO L93 Difference]: Finished difference Result 617 states and 856 transitions. [2019-09-08 01:17:23,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-08 01:17:23,726 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 836 [2019-09-08 01:17:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:23,727 INFO L225 Difference]: With dead ends: 617 [2019-09-08 01:17:23,727 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 01:17:23,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-08 01:17:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 01:17:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2019-09-08 01:17:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-08 01:17:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 845 transitions. [2019-09-08 01:17:23,736 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 845 transitions. Word has length 836 [2019-09-08 01:17:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:23,737 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 845 transitions. [2019-09-08 01:17:23,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-08 01:17:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 845 transitions. [2019-09-08 01:17:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2019-09-08 01:17:23,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:23,742 INFO L399 BasicCegarLoop]: trace histogram [119, 119, 119, 119, 119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:23,742 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:23,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:23,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1319275878, now seen corresponding path program 119 times [2019-09-08 01:17:23,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:23,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:23,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:23,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:23,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 49266 backedges. 0 proven. 35224 refuted. 0 times theorem prover too weak. 14042 trivial. 0 not checked. [2019-09-08 01:17:29,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:29,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:29,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:17:29,946 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 120 check-sat command(s) [2019-09-08 01:17:29,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:29,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 2164 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-08 01:17:29,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 49266 backedges. 0 proven. 35224 refuted. 0 times theorem prover too weak. 14042 trivial. 0 not checked. [2019-09-08 01:17:30,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:30,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 122 [2019-09-08 01:17:30,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-08 01:17:30,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-08 01:17:30,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-08 01:17:30,321 INFO L87 Difference]: Start difference. First operand 608 states and 845 transitions. Second operand 122 states. [2019-09-08 01:17:34,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:34,234 INFO L93 Difference]: Finished difference Result 622 states and 863 transitions. [2019-09-08 01:17:34,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-08 01:17:34,235 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 843 [2019-09-08 01:17:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:34,236 INFO L225 Difference]: With dead ends: 622 [2019-09-08 01:17:34,236 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 01:17:34,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 964 GetRequests, 844 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-08 01:17:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 01:17:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-09-08 01:17:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-08 01:17:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 852 transitions. [2019-09-08 01:17:34,250 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 852 transitions. Word has length 843 [2019-09-08 01:17:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:34,251 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 852 transitions. [2019-09-08 01:17:34,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-08 01:17:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 852 transitions. [2019-09-08 01:17:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2019-09-08 01:17:34,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:34,259 INFO L399 BasicCegarLoop]: trace histogram [120, 120, 120, 120, 120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:34,259 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:34,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash 620857489, now seen corresponding path program 120 times [2019-09-08 01:17:34,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:34,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:34,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:34,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:34,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 50100 backedges. 0 proven. 35820 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2019-09-08 01:17:39,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:39,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:39,906 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:17:40,566 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 121 check-sat command(s) [2019-09-08 01:17:40,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:40,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-08 01:17:40,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 50100 backedges. 0 proven. 35820 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2019-09-08 01:17:40,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:40,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2019-09-08 01:17:40,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-08 01:17:40,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-08 01:17:40,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-08 01:17:40,987 INFO L87 Difference]: Start difference. First operand 613 states and 852 transitions. Second operand 123 states. [2019-09-08 01:17:44,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:44,661 INFO L93 Difference]: Finished difference Result 627 states and 870 transitions. [2019-09-08 01:17:44,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-08 01:17:44,661 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 850 [2019-09-08 01:17:44,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:44,663 INFO L225 Difference]: With dead ends: 627 [2019-09-08 01:17:44,663 INFO L226 Difference]: Without dead ends: 622 [2019-09-08 01:17:44,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-08 01:17:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-08 01:17:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 618. [2019-09-08 01:17:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 01:17:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 859 transitions. [2019-09-08 01:17:44,671 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 859 transitions. Word has length 850 [2019-09-08 01:17:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:44,671 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 859 transitions. [2019-09-08 01:17:44,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-08 01:17:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 859 transitions. [2019-09-08 01:17:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2019-09-08 01:17:44,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:44,677 INFO L399 BasicCegarLoop]: trace histogram [121, 121, 121, 121, 121, 121, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:44,678 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:44,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1009901894, now seen corresponding path program 121 times [2019-09-08 01:17:44,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:44,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:44,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:44,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:44,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 50941 backedges. 0 proven. 36421 refuted. 0 times theorem prover too weak. 14520 trivial. 0 not checked. [2019-09-08 01:17:50,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:50,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:50,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:50,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 2200 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-08 01:17:50,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 50941 backedges. 0 proven. 36421 refuted. 0 times theorem prover too weak. 14520 trivial. 0 not checked. [2019-09-08 01:17:50,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:50,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 124 [2019-09-08 01:17:50,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-08 01:17:50,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-08 01:17:50,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-08 01:17:50,872 INFO L87 Difference]: Start difference. First operand 618 states and 859 transitions. Second operand 124 states. [2019-09-08 01:17:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:54,632 INFO L93 Difference]: Finished difference Result 632 states and 877 transitions. [2019-09-08 01:17:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-08 01:17:54,639 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 857 [2019-09-08 01:17:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:54,641 INFO L225 Difference]: With dead ends: 632 [2019-09-08 01:17:54,641 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 01:17:54,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 858 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-08 01:17:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 01:17:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 623. [2019-09-08 01:17:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 01:17:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 866 transitions. [2019-09-08 01:17:54,650 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 866 transitions. Word has length 857 [2019-09-08 01:17:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:54,651 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 866 transitions. [2019-09-08 01:17:54,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-08 01:17:54,651 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 866 transitions. [2019-09-08 01:17:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2019-09-08 01:17:54,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:54,659 INFO L399 BasicCegarLoop]: trace histogram [122, 122, 122, 122, 122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:54,659 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:54,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1159923599, now seen corresponding path program 122 times [2019-09-08 01:17:54,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:54,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:54,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:54,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:54,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 51789 backedges. 0 proven. 37027 refuted. 0 times theorem prover too weak. 14762 trivial. 0 not checked. [2019-09-08 01:18:00,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:00,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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:00,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:18:00,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:18:00,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:00,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 2218 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-08 01:18:00,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 51789 backedges. 0 proven. 37027 refuted. 0 times theorem prover too weak. 14762 trivial. 0 not checked. [2019-09-08 01:18:01,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:01,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2019-09-08 01:18:01,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-08 01:18:01,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-08 01:18:01,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-08 01:18:01,124 INFO L87 Difference]: Start difference. First operand 623 states and 866 transitions. Second operand 125 states. [2019-09-08 01:18:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:04,876 INFO L93 Difference]: Finished difference Result 637 states and 884 transitions. [2019-09-08 01:18:04,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-08 01:18:04,876 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 864 [2019-09-08 01:18:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:04,877 INFO L225 Difference]: With dead ends: 637 [2019-09-08 01:18:04,877 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 01:18:04,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 988 GetRequests, 865 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-08 01:18:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 01:18:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 628. [2019-09-08 01:18:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 01:18:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 873 transitions. [2019-09-08 01:18:04,885 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 873 transitions. Word has length 864 [2019-09-08 01:18:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:04,886 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 873 transitions. [2019-09-08 01:18:04,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-08 01:18:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 873 transitions. [2019-09-08 01:18:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2019-09-08 01:18:04,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:04,892 INFO L399 BasicCegarLoop]: trace histogram [123, 123, 123, 123, 123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:04,892 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:04,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2031031002, now seen corresponding path program 123 times [2019-09-08 01:18:04,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:04,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:04,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:04,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:04,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 52644 backedges. 0 proven. 37638 refuted. 0 times theorem prover too weak. 15006 trivial. 0 not checked. [2019-09-08 01:18:10,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:10,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:10,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:18:11,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2019-09-08 01:18:11,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:11,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 2236 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-08 01:18:11,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 52644 backedges. 0 proven. 37638 refuted. 0 times theorem prover too weak. 15006 trivial. 0 not checked. [2019-09-08 01:18:11,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:11,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 126 [2019-09-08 01:18:11,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-08 01:18:11,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-08 01:18:11,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 01:18:11,698 INFO L87 Difference]: Start difference. First operand 628 states and 873 transitions. Second operand 126 states. [2019-09-08 01:18:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:15,757 INFO L93 Difference]: Finished difference Result 642 states and 891 transitions. [2019-09-08 01:18:15,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-08 01:18:15,758 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 871 [2019-09-08 01:18:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:15,759 INFO L225 Difference]: With dead ends: 642 [2019-09-08 01:18:15,759 INFO L226 Difference]: Without dead ends: 637 [2019-09-08 01:18:15,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 01:18:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-08 01:18:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2019-09-08 01:18:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 01:18:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 880 transitions. [2019-09-08 01:18:15,770 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 880 transitions. Word has length 871 [2019-09-08 01:18:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:15,771 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 880 transitions. [2019-09-08 01:18:15,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-08 01:18:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 880 transitions. [2019-09-08 01:18:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2019-09-08 01:18:15,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:15,777 INFO L399 BasicCegarLoop]: trace histogram [124, 124, 124, 124, 124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:15,777 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:15,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:15,777 INFO L82 PathProgramCache]: Analyzing trace with hash 948379729, now seen corresponding path program 124 times [2019-09-08 01:18:15,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:15,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:15,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:15,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:15,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 53506 backedges. 0 proven. 38254 refuted. 0 times theorem prover too weak. 15252 trivial. 0 not checked. [2019-09-08 01:18:21,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:21,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:21,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:18:22,018 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:18:22,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:22,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 2254 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-08 01:18:22,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 53506 backedges. 0 proven. 38254 refuted. 0 times theorem prover too weak. 15252 trivial. 0 not checked. [2019-09-08 01:18:22,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:22,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2019-09-08 01:18:22,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-08 01:18:22,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-08 01:18:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-08 01:18:22,450 INFO L87 Difference]: Start difference. First operand 633 states and 880 transitions. Second operand 127 states. [2019-09-08 01:18:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:27,095 INFO L93 Difference]: Finished difference Result 647 states and 898 transitions. [2019-09-08 01:18:27,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-08 01:18:27,095 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 878 [2019-09-08 01:18:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:27,097 INFO L225 Difference]: With dead ends: 647 [2019-09-08 01:18:27,097 INFO L226 Difference]: Without dead ends: 642 [2019-09-08 01:18:27,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1004 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-08 01:18:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-08 01:18:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 638. [2019-09-08 01:18:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 01:18:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 887 transitions. [2019-09-08 01:18:27,106 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 887 transitions. Word has length 878 [2019-09-08 01:18:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:27,107 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 887 transitions. [2019-09-08 01:18:27,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-08 01:18:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 887 transitions. [2019-09-08 01:18:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2019-09-08 01:18:27,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:27,112 INFO L399 BasicCegarLoop]: trace histogram [125, 125, 125, 125, 125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:27,113 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1526877946, now seen corresponding path program 125 times [2019-09-08 01:18:27,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:27,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:27,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:27,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:27,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 54375 backedges. 0 proven. 38875 refuted. 0 times theorem prover too weak. 15500 trivial. 0 not checked. [2019-09-08 01:18:32,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:32,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:32,991 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:18:33,624 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 126 check-sat command(s) [2019-09-08 01:18:33,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:33,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 2272 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-08 01:18:33,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 54375 backedges. 0 proven. 38875 refuted. 0 times theorem prover too weak. 15500 trivial. 0 not checked. [2019-09-08 01:18:34,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:34,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 128 [2019-09-08 01:18:34,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-08 01:18:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-08 01:18:34,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-08 01:18:34,057 INFO L87 Difference]: Start difference. First operand 638 states and 887 transitions. Second operand 128 states. [2019-09-08 01:18:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:38,402 INFO L93 Difference]: Finished difference Result 652 states and 905 transitions. [2019-09-08 01:18:38,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-08 01:18:38,402 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 885 [2019-09-08 01:18:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:38,404 INFO L225 Difference]: With dead ends: 652 [2019-09-08 01:18:38,404 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 01:18:38,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 886 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-08 01:18:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 01:18:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 643. [2019-09-08 01:18:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 01:18:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 894 transitions. [2019-09-08 01:18:38,411 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 894 transitions. Word has length 885 [2019-09-08 01:18:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:38,412 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 894 transitions. [2019-09-08 01:18:38,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-08 01:18:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 894 transitions. [2019-09-08 01:18:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2019-09-08 01:18:38,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:38,417 INFO L399 BasicCegarLoop]: trace histogram [126, 126, 126, 126, 126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:38,418 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1847721935, now seen corresponding path program 126 times [2019-09-08 01:18:38,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:38,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:38,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:38,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:38,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 55251 backedges. 0 proven. 39501 refuted. 0 times theorem prover too weak. 15750 trivial. 0 not checked. [2019-09-08 01:18:44,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:44,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:44,478 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:18:45,157 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2019-09-08 01:18:45,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:45,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 2290 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-08 01:18:45,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 55251 backedges. 0 proven. 39501 refuted. 0 times theorem prover too weak. 15750 trivial. 0 not checked. [2019-09-08 01:18:45,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:45,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2019-09-08 01:18:45,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-08 01:18:45,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-08 01:18:45,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 01:18:45,567 INFO L87 Difference]: Start difference. First operand 643 states and 894 transitions. Second operand 129 states. [2019-09-08 01:18:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:49,574 INFO L93 Difference]: Finished difference Result 657 states and 912 transitions. [2019-09-08 01:18:49,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-08 01:18:49,574 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 892 [2019-09-08 01:18:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:49,576 INFO L225 Difference]: With dead ends: 657 [2019-09-08 01:18:49,576 INFO L226 Difference]: Without dead ends: 652 [2019-09-08 01:18:49,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 893 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 01:18:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-08 01:18:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 648. [2019-09-08 01:18:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-08 01:18:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 901 transitions. [2019-09-08 01:18:49,586 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 901 transitions. Word has length 892 [2019-09-08 01:18:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:49,586 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 901 transitions. [2019-09-08 01:18:49,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-08 01:18:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 901 transitions. [2019-09-08 01:18:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2019-09-08 01:18:49,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:49,592 INFO L399 BasicCegarLoop]: trace histogram [127, 127, 127, 127, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:49,593 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:49,593 INFO L82 PathProgramCache]: Analyzing trace with hash 643866, now seen corresponding path program 127 times [2019-09-08 01:18:49,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:49,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:49,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 56134 backedges. 0 proven. 40132 refuted. 0 times theorem prover too weak. 16002 trivial. 0 not checked. [2019-09-08 01:18:55,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:55,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:55,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:55,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 2308 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-08 01:18:56,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 56134 backedges. 0 proven. 40132 refuted. 0 times theorem prover too weak. 16002 trivial. 0 not checked. [2019-09-08 01:18:56,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:56,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130] total 130 [2019-09-08 01:18:56,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-08 01:18:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-08 01:18:56,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-08 01:18:56,404 INFO L87 Difference]: Start difference. First operand 648 states and 901 transitions. Second operand 130 states. [2019-09-08 01:19:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:01,585 INFO L93 Difference]: Finished difference Result 662 states and 919 transitions. [2019-09-08 01:19:01,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-08 01:19:01,585 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 899 [2019-09-08 01:19:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:01,587 INFO L225 Difference]: With dead ends: 662 [2019-09-08 01:19:01,587 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 01:19:01,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1028 GetRequests, 900 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-08 01:19:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 01:19:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 653. [2019-09-08 01:19:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-08 01:19:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 908 transitions. [2019-09-08 01:19:01,597 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 908 transitions. Word has length 899 [2019-09-08 01:19:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:01,598 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 908 transitions. [2019-09-08 01:19:01,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-08 01:19:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 908 transitions. [2019-09-08 01:19:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2019-09-08 01:19:01,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:01,603 INFO L399 BasicCegarLoop]: trace histogram [128, 128, 128, 128, 128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:01,604 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:01,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1639999471, now seen corresponding path program 128 times [2019-09-08 01:19:01,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:01,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:01,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:01,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:19:01,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 57024 backedges. 0 proven. 40768 refuted. 0 times theorem prover too weak. 16256 trivial. 0 not checked. [2019-09-08 01:19:07,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:07,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:07,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:19:08,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:19:08,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:08,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 2326 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-08 01:19:08,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 57024 backedges. 0 proven. 40768 refuted. 0 times theorem prover too weak. 16256 trivial. 0 not checked. [2019-09-08 01:19:08,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:08,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2019-09-08 01:19:08,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-08 01:19:08,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-08 01:19:08,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-08 01:19:08,513 INFO L87 Difference]: Start difference. First operand 653 states and 908 transitions. Second operand 131 states. [2019-09-08 01:19:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:13,402 INFO L93 Difference]: Finished difference Result 667 states and 926 transitions. [2019-09-08 01:19:13,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-08 01:19:13,403 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 906 [2019-09-08 01:19:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:13,404 INFO L225 Difference]: With dead ends: 667 [2019-09-08 01:19:13,404 INFO L226 Difference]: Without dead ends: 662 [2019-09-08 01:19:13,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1036 GetRequests, 907 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-08 01:19:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-09-08 01:19:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 658. [2019-09-08 01:19:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-08 01:19:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 915 transitions. [2019-09-08 01:19:13,413 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 915 transitions. Word has length 906 [2019-09-08 01:19:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:13,414 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 915 transitions. [2019-09-08 01:19:13,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-08 01:19:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 915 transitions. [2019-09-08 01:19:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2019-09-08 01:19:13,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:13,420 INFO L399 BasicCegarLoop]: trace histogram [129, 129, 129, 129, 129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:13,420 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:13,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash 721919802, now seen corresponding path program 129 times [2019-09-08 01:19:13,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:13,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:13,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 57921 backedges. 0 proven. 41409 refuted. 0 times theorem prover too weak. 16512 trivial. 0 not checked. [2019-09-08 01:19:19,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:19,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:19,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:19:20,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 130 check-sat command(s) [2019-09-08 01:19:20,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:20,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 2344 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-08 01:19:20,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 57921 backedges. 0 proven. 41409 refuted. 0 times theorem prover too weak. 16512 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (130)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:19:20,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:20,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 132 [2019-09-08 01:19:20,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-08 01:19:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-08 01:19:20,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 01:19:20,942 INFO L87 Difference]: Start difference. First operand 658 states and 915 transitions. Second operand 132 states. [2019-09-08 01:19:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:23,923 INFO L93 Difference]: Finished difference Result 672 states and 933 transitions. [2019-09-08 01:19:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-08 01:19:23,923 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 913 [2019-09-08 01:19:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:23,925 INFO L225 Difference]: With dead ends: 672 [2019-09-08 01:19:23,925 INFO L226 Difference]: Without dead ends: 667 [2019-09-08 01:19:23,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 914 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 01:19:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-09-08 01:19:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 663. [2019-09-08 01:19:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-08 01:19:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 922 transitions. [2019-09-08 01:19:23,934 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 922 transitions. Word has length 913 [2019-09-08 01:19:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:23,935 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 922 transitions. [2019-09-08 01:19:23,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-08 01:19:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 922 transitions. [2019-09-08 01:19:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2019-09-08 01:19:23,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:23,940 INFO L399 BasicCegarLoop]: trace histogram [130, 130, 130, 130, 130, 130, 130, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:23,940 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:23,941 INFO L82 PathProgramCache]: Analyzing trace with hash -125179919, now seen corresponding path program 130 times [2019-09-08 01:19:23,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:23,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:23,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:23,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 58825 backedges. 0 proven. 42055 refuted. 0 times theorem prover too weak. 16770 trivial. 0 not checked. [2019-09-08 01:19:30,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:30,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:30,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:19:30,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:19:30,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:30,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 2362 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-08 01:19:30,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 58825 backedges. 0 proven. 42055 refuted. 0 times theorem prover too weak. 16770 trivial. 0 not checked. [2019-09-08 01:19:31,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:31,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2019-09-08 01:19:31,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-08 01:19:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-08 01:19:31,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-09-08 01:19:31,079 INFO L87 Difference]: Start difference. First operand 663 states and 922 transitions. Second operand 133 states. [2019-09-08 01:19:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:36,093 INFO L93 Difference]: Finished difference Result 677 states and 940 transitions. [2019-09-08 01:19:36,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-08 01:19:36,093 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 920 [2019-09-08 01:19:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:36,095 INFO L225 Difference]: With dead ends: 677 [2019-09-08 01:19:36,095 INFO L226 Difference]: Without dead ends: 672 [2019-09-08 01:19:36,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1052 GetRequests, 921 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-09-08 01:19:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-08 01:19:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 668. [2019-09-08 01:19:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-08 01:19:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 929 transitions. [2019-09-08 01:19:36,103 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 929 transitions. Word has length 920 [2019-09-08 01:19:36,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:36,103 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 929 transitions. [2019-09-08 01:19:36,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-08 01:19:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 929 transitions. [2019-09-08 01:19:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2019-09-08 01:19:36,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:36,109 INFO L399 BasicCegarLoop]: trace histogram [131, 131, 131, 131, 131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:36,109 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash -346180774, now seen corresponding path program 131 times [2019-09-08 01:19:36,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:36,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:36,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 59736 backedges. 0 proven. 42706 refuted. 0 times theorem prover too weak. 17030 trivial. 0 not checked. [2019-09-08 01:19:42,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:42,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:42,722 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:19:43,464 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 132 check-sat command(s) [2019-09-08 01:19:43,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:43,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 2380 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-08 01:19:43,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 59736 backedges. 0 proven. 42706 refuted. 0 times theorem prover too weak. 17030 trivial. 0 not checked. [2019-09-08 01:19:43,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:43,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 134 [2019-09-08 01:19:43,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-09-08 01:19:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-09-08 01:19:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-08 01:19:43,900 INFO L87 Difference]: Start difference. First operand 668 states and 929 transitions. Second operand 134 states. [2019-09-08 01:19:47,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:47,477 INFO L93 Difference]: Finished difference Result 682 states and 947 transitions. [2019-09-08 01:19:47,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-08 01:19:47,477 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 927 [2019-09-08 01:19:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:47,478 INFO L225 Difference]: With dead ends: 682 [2019-09-08 01:19:47,479 INFO L226 Difference]: Without dead ends: 677 [2019-09-08 01:19:47,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 928 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-08 01:19:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-09-08 01:19:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 673. [2019-09-08 01:19:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-09-08 01:19:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 936 transitions. [2019-09-08 01:19:47,487 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 936 transitions. Word has length 927 [2019-09-08 01:19:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:47,487 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 936 transitions. [2019-09-08 01:19:47,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-09-08 01:19:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 936 transitions. [2019-09-08 01:19:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2019-09-08 01:19:47,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:47,493 INFO L399 BasicCegarLoop]: trace histogram [132, 132, 132, 132, 132, 132, 132, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:47,493 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:47,493 INFO L82 PathProgramCache]: Analyzing trace with hash -551882799, now seen corresponding path program 132 times [2019-09-08 01:19:47,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:47,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:47,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:47,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:47,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 60654 backedges. 0 proven. 43362 refuted. 0 times theorem prover too weak. 17292 trivial. 0 not checked. [2019-09-08 01:19:54,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:54,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:54,096 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:19:54,848 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 133 check-sat command(s) [2019-09-08 01:19:54,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:54,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 2398 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-08 01:19:54,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 60654 backedges. 0 proven. 43362 refuted. 0 times theorem prover too weak. 17292 trivial. 0 not checked. [2019-09-08 01:19:55,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:55,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2019-09-08 01:19:55,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-08 01:19:55,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-08 01:19:55,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-08 01:19:55,319 INFO L87 Difference]: Start difference. First operand 673 states and 936 transitions. Second operand 135 states. [2019-09-08 01:19:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:58,212 INFO L93 Difference]: Finished difference Result 687 states and 954 transitions. [2019-09-08 01:19:58,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-08 01:19:58,213 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 934 [2019-09-08 01:19:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:58,214 INFO L225 Difference]: With dead ends: 687 [2019-09-08 01:19:58,214 INFO L226 Difference]: Without dead ends: 682 [2019-09-08 01:19:58,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1068 GetRequests, 935 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-08 01:19:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-08 01:19:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 678. [2019-09-08 01:19:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-09-08 01:19:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 943 transitions. [2019-09-08 01:19:58,224 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 943 transitions. Word has length 934 [2019-09-08 01:19:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:58,224 INFO L475 AbstractCegarLoop]: Abstraction has 678 states and 943 transitions. [2019-09-08 01:19:58,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-08 01:19:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 943 transitions. [2019-09-08 01:19:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2019-09-08 01:19:58,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:58,230 INFO L399 BasicCegarLoop]: trace histogram [133, 133, 133, 133, 133, 133, 133, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:58,231 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:58,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:58,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1125249158, now seen corresponding path program 133 times [2019-09-08 01:19:58,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:58,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:58,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 61579 backedges. 0 proven. 44023 refuted. 0 times theorem prover too weak. 17556 trivial. 0 not checked. [2019-09-08 01:20:05,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:05,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:05,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:20:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:05,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 2416 conjuncts, 135 conjunts are in the unsatisfiable core [2019-09-08 01:20:05,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 61579 backedges. 0 proven. 44023 refuted. 0 times theorem prover too weak. 17556 trivial. 0 not checked. [2019-09-08 01:20:05,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:05,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136] total 136 [2019-09-08 01:20:05,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-08 01:20:05,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-08 01:20:05,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-08 01:20:05,863 INFO L87 Difference]: Start difference. First operand 678 states and 943 transitions. Second operand 136 states. [2019-09-08 01:20:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:08,653 INFO L93 Difference]: Finished difference Result 692 states and 961 transitions. [2019-09-08 01:20:08,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-08 01:20:08,653 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 941 [2019-09-08 01:20:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:08,655 INFO L225 Difference]: With dead ends: 692 [2019-09-08 01:20:08,655 INFO L226 Difference]: Without dead ends: 687 [2019-09-08 01:20:08,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 942 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-08 01:20:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-09-08 01:20:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 683. [2019-09-08 01:20:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-09-08 01:20:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 950 transitions. [2019-09-08 01:20:08,665 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 950 transitions. Word has length 941 [2019-09-08 01:20:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:08,665 INFO L475 AbstractCegarLoop]: Abstraction has 683 states and 950 transitions. [2019-09-08 01:20:08,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-08 01:20:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 950 transitions. [2019-09-08 01:20:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 949 [2019-09-08 01:20:08,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:08,671 INFO L399 BasicCegarLoop]: trace histogram [134, 134, 134, 134, 134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:08,672 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash 332443569, now seen corresponding path program 134 times [2019-09-08 01:20:08,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:08,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:08,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:08,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:20:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 62511 backedges. 0 proven. 44689 refuted. 0 times theorem prover too weak. 17822 trivial. 0 not checked. [2019-09-08 01:20:15,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:15,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:15,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:20:15,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:20:15,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:15,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 2434 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-08 01:20:15,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 62511 backedges. 0 proven. 44689 refuted. 0 times theorem prover too weak. 17822 trivial. 0 not checked. [2019-09-08 01:20:16,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:16,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2019-09-08 01:20:16,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-08 01:20:16,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-08 01:20:16,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-08 01:20:16,236 INFO L87 Difference]: Start difference. First operand 683 states and 950 transitions. Second operand 137 states. [2019-09-08 01:20:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:18,705 INFO L93 Difference]: Finished difference Result 697 states and 968 transitions. [2019-09-08 01:20:18,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-08 01:20:18,705 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 948 [2019-09-08 01:20:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:18,707 INFO L225 Difference]: With dead ends: 697 [2019-09-08 01:20:18,707 INFO L226 Difference]: Without dead ends: 692 [2019-09-08 01:20:18,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1084 GetRequests, 949 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-08 01:20:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-09-08 01:20:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 688. [2019-09-08 01:20:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-09-08 01:20:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 957 transitions. [2019-09-08 01:20:18,716 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 957 transitions. Word has length 948 [2019-09-08 01:20:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:18,717 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 957 transitions. [2019-09-08 01:20:18,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-08 01:20:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 957 transitions. [2019-09-08 01:20:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2019-09-08 01:20:18,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:18,723 INFO L399 BasicCegarLoop]: trace histogram [135, 135, 135, 135, 135, 135, 135, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:18,723 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:18,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1474645094, now seen corresponding path program 135 times [2019-09-08 01:20:18,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:18,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:18,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:18,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 63450 backedges. 0 proven. 45360 refuted. 0 times theorem prover too weak. 18090 trivial. 0 not checked. [2019-09-08 01:20:25,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:25,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:25,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:20:26,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 136 check-sat command(s) [2019-09-08 01:20:26,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:26,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 2452 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-08 01:20:26,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 63450 backedges. 0 proven. 45360 refuted. 0 times theorem prover too weak. 18090 trivial. 0 not checked. [2019-09-08 01:20:26,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:26,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138] total 138 [2019-09-08 01:20:26,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-08 01:20:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-08 01:20:26,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 01:20:26,827 INFO L87 Difference]: Start difference. First operand 688 states and 957 transitions. Second operand 138 states. [2019-09-08 01:20:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:30,724 INFO L93 Difference]: Finished difference Result 702 states and 975 transitions. [2019-09-08 01:20:30,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-08 01:20:30,725 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 955 [2019-09-08 01:20:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:30,726 INFO L225 Difference]: With dead ends: 702 [2019-09-08 01:20:30,726 INFO L226 Difference]: Without dead ends: 697 [2019-09-08 01:20:30,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 956 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 01:20:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-08 01:20:30,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 693. [2019-09-08 01:20:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-09-08 01:20:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 964 transitions. [2019-09-08 01:20:30,735 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 964 transitions. Word has length 955 [2019-09-08 01:20:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:30,735 INFO L475 AbstractCegarLoop]: Abstraction has 693 states and 964 transitions. [2019-09-08 01:20:30,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-08 01:20:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 964 transitions. [2019-09-08 01:20:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2019-09-08 01:20:30,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:30,742 INFO L399 BasicCegarLoop]: trace histogram [136, 136, 136, 136, 136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:30,742 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1140250735, now seen corresponding path program 136 times [2019-09-08 01:20:30,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:30,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:30,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 64396 backedges. 0 proven. 46036 refuted. 0 times theorem prover too weak. 18360 trivial. 0 not checked. [2019-09-08 01:20:37,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:37,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:37,624 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:20:37,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:20:37,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:37,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 2470 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-08 01:20:37,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 64396 backedges. 0 proven. 46036 refuted. 0 times theorem prover too weak. 18360 trivial. 0 not checked. [2019-09-08 01:20:38,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:38,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2019-09-08 01:20:38,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-08 01:20:38,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-08 01:20:38,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 01:20:38,452 INFO L87 Difference]: Start difference. First operand 693 states and 964 transitions. Second operand 139 states. [2019-09-08 01:20:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:42,883 INFO L93 Difference]: Finished difference Result 707 states and 982 transitions. [2019-09-08 01:20:42,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-08 01:20:42,884 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 962 [2019-09-08 01:20:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:42,885 INFO L225 Difference]: With dead ends: 707 [2019-09-08 01:20:42,885 INFO L226 Difference]: Without dead ends: 702 [2019-09-08 01:20:42,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1100 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 01:20:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-09-08 01:20:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 698. [2019-09-08 01:20:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-09-08 01:20:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 971 transitions. [2019-09-08 01:20:42,894 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 971 transitions. Word has length 962 [2019-09-08 01:20:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:42,894 INFO L475 AbstractCegarLoop]: Abstraction has 698 states and 971 transitions. [2019-09-08 01:20:42,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-08 01:20:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 971 transitions. [2019-09-08 01:20:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2019-09-08 01:20:42,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:42,901 INFO L399 BasicCegarLoop]: trace histogram [137, 137, 137, 137, 137, 137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:42,901 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:42,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:42,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1640341434, now seen corresponding path program 137 times [2019-09-08 01:20:42,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:42,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:42,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:42,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:42,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 65349 backedges. 0 proven. 46717 refuted. 0 times theorem prover too weak. 18632 trivial. 0 not checked. [2019-09-08 01:20:49,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:49,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:49,918 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:20:50,702 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 138 check-sat command(s) [2019-09-08 01:20:50,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:50,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-08 01:20:50,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 65349 backedges. 0 proven. 46717 refuted. 0 times theorem prover too weak. 18632 trivial. 0 not checked. [2019-09-08 01:20:51,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:51,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 140 [2019-09-08 01:20:51,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-09-08 01:20:51,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-09-08 01:20:51,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-08 01:20:51,208 INFO L87 Difference]: Start difference. First operand 698 states and 971 transitions. Second operand 140 states. [2019-09-08 01:20:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:53,987 INFO L93 Difference]: Finished difference Result 712 states and 989 transitions. [2019-09-08 01:20:53,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-08 01:20:53,987 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 969 [2019-09-08 01:20:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:53,989 INFO L225 Difference]: With dead ends: 712 [2019-09-08 01:20:53,989 INFO L226 Difference]: Without dead ends: 707 [2019-09-08 01:20:53,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1108 GetRequests, 970 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-08 01:20:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-09-08 01:20:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 703. [2019-09-08 01:20:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-08 01:20:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 978 transitions. [2019-09-08 01:20:53,998 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 978 transitions. Word has length 969 [2019-09-08 01:20:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:53,999 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 978 transitions. [2019-09-08 01:20:53,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-09-08 01:20:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 978 transitions. [2019-09-08 01:20:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2019-09-08 01:20:54,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:54,005 INFO L399 BasicCegarLoop]: trace histogram [138, 138, 138, 138, 138, 138, 138, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:54,005 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1084381041, now seen corresponding path program 138 times [2019-09-08 01:20:54,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:54,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:54,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 66309 backedges. 0 proven. 47403 refuted. 0 times theorem prover too weak. 18906 trivial. 0 not checked. [2019-09-08 01:21:01,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:01,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:01,305 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:21:02,091 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2019-09-08 01:21:02,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:02,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 2506 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-08 01:21:02,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 66309 backedges. 0 proven. 47403 refuted. 0 times theorem prover too weak. 18906 trivial. 0 not checked. [2019-09-08 01:21:02,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:02,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2019-09-08 01:21:02,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-08 01:21:02,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-08 01:21:02,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-08 01:21:02,604 INFO L87 Difference]: Start difference. First operand 703 states and 978 transitions. Second operand 141 states. [2019-09-08 01:21:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:07,248 INFO L93 Difference]: Finished difference Result 717 states and 996 transitions. [2019-09-08 01:21:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-08 01:21:07,249 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 976 [2019-09-08 01:21:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:07,250 INFO L225 Difference]: With dead ends: 717 [2019-09-08 01:21:07,250 INFO L226 Difference]: Without dead ends: 712 [2019-09-08 01:21:07,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 977 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-08 01:21:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-08 01:21:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 708. [2019-09-08 01:21:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-08 01:21:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 985 transitions. [2019-09-08 01:21:07,258 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 985 transitions. Word has length 976 [2019-09-08 01:21:07,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:07,259 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 985 transitions. [2019-09-08 01:21:07,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-08 01:21:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 985 transitions. [2019-09-08 01:21:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2019-09-08 01:21:07,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:07,265 INFO L399 BasicCegarLoop]: trace histogram [139, 139, 139, 139, 139, 139, 139, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:07,265 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1800459226, now seen corresponding path program 139 times [2019-09-08 01:21:07,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:07,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:07,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:07,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:07,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 67276 backedges. 0 proven. 48094 refuted. 0 times theorem prover too weak. 19182 trivial. 0 not checked. [2019-09-08 01:21:14,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:14,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:14,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:21:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:15,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-08 01:21:15,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 67276 backedges. 0 proven. 48094 refuted. 0 times theorem prover too weak. 19182 trivial. 0 not checked. [2019-09-08 01:21:15,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:15,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 142] total 142 [2019-09-08 01:21:15,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-08 01:21:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-08 01:21:15,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-08 01:21:15,523 INFO L87 Difference]: Start difference. First operand 708 states and 985 transitions. Second operand 142 states. [2019-09-08 01:21:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:20,144 INFO L93 Difference]: Finished difference Result 722 states and 1003 transitions. [2019-09-08 01:21:20,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-08 01:21:20,145 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 983 [2019-09-08 01:21:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:20,146 INFO L225 Difference]: With dead ends: 722 [2019-09-08 01:21:20,146 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 01:21:20,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1124 GetRequests, 984 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-08 01:21:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 01:21:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2019-09-08 01:21:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-09-08 01:21:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 992 transitions. [2019-09-08 01:21:20,156 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 992 transitions. Word has length 983 [2019-09-08 01:21:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:20,156 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 992 transitions. [2019-09-08 01:21:20,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-08 01:21:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 992 transitions. [2019-09-08 01:21:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2019-09-08 01:21:20,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:20,163 INFO L399 BasicCegarLoop]: trace histogram [140, 140, 140, 140, 140, 140, 140, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:20,163 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:20,164 INFO L82 PathProgramCache]: Analyzing trace with hash 771374929, now seen corresponding path program 140 times [2019-09-08 01:21:20,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:20,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:20,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:21:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 68250 backedges. 0 proven. 48790 refuted. 0 times theorem prover too weak. 19460 trivial. 0 not checked. [2019-09-08 01:21:27,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:27,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:27,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:21:27,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:21:27,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:27,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 2542 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-08 01:21:27,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 68250 backedges. 0 proven. 48790 refuted. 0 times theorem prover too weak. 19460 trivial. 0 not checked. [2019-09-08 01:21:28,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:28,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2019-09-08 01:21:28,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-08 01:21:28,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-08 01:21:28,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-08 01:21:28,365 INFO L87 Difference]: Start difference. First operand 713 states and 992 transitions. Second operand 143 states. [2019-09-08 01:21:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:33,345 INFO L93 Difference]: Finished difference Result 727 states and 1010 transitions. [2019-09-08 01:21:33,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-08 01:21:33,345 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 990 [2019-09-08 01:21:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:33,346 INFO L225 Difference]: With dead ends: 727 [2019-09-08 01:21:33,347 INFO L226 Difference]: Without dead ends: 722 [2019-09-08 01:21:33,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1132 GetRequests, 991 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-08 01:21:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-09-08 01:21:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 718. [2019-09-08 01:21:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-09-08 01:21:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 999 transitions. [2019-09-08 01:21:33,355 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 999 transitions. Word has length 990 [2019-09-08 01:21:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:33,356 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 999 transitions. [2019-09-08 01:21:33,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-08 01:21:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 999 transitions. [2019-09-08 01:21:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2019-09-08 01:21:33,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:33,363 INFO L399 BasicCegarLoop]: trace histogram [141, 141, 141, 141, 141, 141, 141, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:33,363 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:33,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:33,363 INFO L82 PathProgramCache]: Analyzing trace with hash 849235962, now seen corresponding path program 141 times [2019-09-08 01:21:33,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:33,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:33,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:33,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:33,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 69231 backedges. 0 proven. 49491 refuted. 0 times theorem prover too weak. 19740 trivial. 0 not checked. [2019-09-08 01:21:40,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:40,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:40,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:21:41,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 142 check-sat command(s) [2019-09-08 01:21:41,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:41,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 2560 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-08 01:21:41,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 69231 backedges. 0 proven. 49491 refuted. 0 times theorem prover too weak. 19740 trivial. 0 not checked. [2019-09-08 01:21:42,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:42,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 144] total 144 [2019-09-08 01:21:42,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-08 01:21:42,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-08 01:21:42,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-08 01:21:42,184 INFO L87 Difference]: Start difference. First operand 718 states and 999 transitions. Second operand 144 states. [2019-09-08 01:21:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:46,700 INFO L93 Difference]: Finished difference Result 732 states and 1017 transitions. [2019-09-08 01:21:46,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-08 01:21:46,701 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 997 [2019-09-08 01:21:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:46,702 INFO L225 Difference]: With dead ends: 732 [2019-09-08 01:21:46,702 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 01:21:46,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1140 GetRequests, 998 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-08 01:21:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 01:21:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 723. [2019-09-08 01:21:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-09-08 01:21:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1006 transitions. [2019-09-08 01:21:46,711 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1006 transitions. Word has length 997 [2019-09-08 01:21:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:46,711 INFO L475 AbstractCegarLoop]: Abstraction has 723 states and 1006 transitions. [2019-09-08 01:21:46,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-08 01:21:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1006 transitions. [2019-09-08 01:21:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1005 [2019-09-08 01:21:46,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:46,718 INFO L399 BasicCegarLoop]: trace histogram [142, 142, 142, 142, 142, 142, 142, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:46,718 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:46,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:46,718 INFO L82 PathProgramCache]: Analyzing trace with hash 334421809, now seen corresponding path program 142 times [2019-09-08 01:21:46,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:46,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:46,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:46,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:46,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 70219 backedges. 0 proven. 50197 refuted. 0 times theorem prover too weak. 20022 trivial. 0 not checked. [2019-09-08 01:21:54,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:54,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:54,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:21:54,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:21:54,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:54,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 2578 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-08 01:21:54,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 70219 backedges. 0 proven. 50197 refuted. 0 times theorem prover too weak. 20022 trivial. 0 not checked. [2019-09-08 01:21:55,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:55,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2019-09-08 01:21:55,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-08 01:21:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-08 01:21:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-08 01:21:55,273 INFO L87 Difference]: Start difference. First operand 723 states and 1006 transitions. Second operand 145 states. [2019-09-08 01:22:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:00,352 INFO L93 Difference]: Finished difference Result 737 states and 1024 transitions. [2019-09-08 01:22:00,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 01:22:00,353 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 1004 [2019-09-08 01:22:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:00,354 INFO L225 Difference]: With dead ends: 737 [2019-09-08 01:22:00,354 INFO L226 Difference]: Without dead ends: 732 [2019-09-08 01:22:00,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1148 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-08 01:22:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-09-08 01:22:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 728. [2019-09-08 01:22:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-09-08 01:22:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1013 transitions. [2019-09-08 01:22:00,364 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1013 transitions. Word has length 1004 [2019-09-08 01:22:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:00,365 INFO L475 AbstractCegarLoop]: Abstraction has 728 states and 1013 transitions. [2019-09-08 01:22:00,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-08 01:22:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1013 transitions. [2019-09-08 01:22:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2019-09-08 01:22:00,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:00,371 INFO L399 BasicCegarLoop]: trace histogram [143, 143, 143, 143, 143, 143, 143, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:00,372 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:00,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:00,372 INFO L82 PathProgramCache]: Analyzing trace with hash 839914522, now seen corresponding path program 143 times [2019-09-08 01:22:00,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:00,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:00,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:00,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:00,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 71214 backedges. 0 proven. 50908 refuted. 0 times theorem prover too weak. 20306 trivial. 0 not checked. [2019-09-08 01:22:08,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:08,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:08,038 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:22:08,886 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 144 check-sat command(s) [2019-09-08 01:22:08,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:08,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-08 01:22:08,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 71214 backedges. 0 proven. 50908 refuted. 0 times theorem prover too weak. 20306 trivial. 0 not checked. [2019-09-08 01:22:09,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:09,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 146 [2019-09-08 01:22:09,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-09-08 01:22:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-09-08 01:22:09,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-08 01:22:09,436 INFO L87 Difference]: Start difference. First operand 728 states and 1013 transitions. Second operand 146 states. [2019-09-08 01:22:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:12,620 INFO L93 Difference]: Finished difference Result 742 states and 1031 transitions. [2019-09-08 01:22:12,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-08 01:22:12,620 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 1011 [2019-09-08 01:22:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:12,622 INFO L225 Difference]: With dead ends: 742 [2019-09-08 01:22:12,622 INFO L226 Difference]: Without dead ends: 737 [2019-09-08 01:22:12,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 1012 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-08 01:22:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-08 01:22:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 733. [2019-09-08 01:22:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-09-08 01:22:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1020 transitions. [2019-09-08 01:22:12,631 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1020 transitions. Word has length 1011 [2019-09-08 01:22:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:12,632 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1020 transitions. [2019-09-08 01:22:12,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-09-08 01:22:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1020 transitions. [2019-09-08 01:22:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1019 [2019-09-08 01:22:12,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:12,639 INFO L399 BasicCegarLoop]: trace histogram [144, 144, 144, 144, 144, 144, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:12,639 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:12,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1709061905, now seen corresponding path program 144 times [2019-09-08 01:22:12,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:12,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:12,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 72216 backedges. 0 proven. 51624 refuted. 0 times theorem prover too weak. 20592 trivial. 0 not checked. [2019-09-08 01:22:20,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:20,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:20,580 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:22:21,436 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2019-09-08 01:22:21,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:21,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-08 01:22:21,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 72216 backedges. 0 proven. 51624 refuted. 0 times theorem prover too weak. 20592 trivial. 0 not checked. [2019-09-08 01:22:21,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:21,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2019-09-08 01:22:21,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-08 01:22:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-08 01:22:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-08 01:22:21,988 INFO L87 Difference]: Start difference. First operand 733 states and 1020 transitions. Second operand 147 states. [2019-09-08 01:22:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:27,328 INFO L93 Difference]: Finished difference Result 747 states and 1038 transitions. [2019-09-08 01:22:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-08 01:22:27,328 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 1018 [2019-09-08 01:22:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:27,330 INFO L225 Difference]: With dead ends: 747 [2019-09-08 01:22:27,330 INFO L226 Difference]: Without dead ends: 742 [2019-09-08 01:22:27,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1164 GetRequests, 1019 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-08 01:22:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-08 01:22:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 738. [2019-09-08 01:22:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-08 01:22:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1027 transitions. [2019-09-08 01:22:27,339 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1027 transitions. Word has length 1018 [2019-09-08 01:22:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:27,339 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1027 transitions. [2019-09-08 01:22:27,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-08 01:22:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1027 transitions. [2019-09-08 01:22:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2019-09-08 01:22:27,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:27,346 INFO L399 BasicCegarLoop]: trace histogram [145, 145, 145, 145, 145, 145, 145, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:27,346 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash 277356602, now seen corresponding path program 145 times [2019-09-08 01:22:27,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:27,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:27,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:27,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 73225 backedges. 0 proven. 52345 refuted. 0 times theorem prover too weak. 20880 trivial. 0 not checked. [2019-09-08 01:22:35,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:35,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:35,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:22:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:35,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 2632 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-08 01:22:35,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 73225 backedges. 0 proven. 52345 refuted. 0 times theorem prover too weak. 20880 trivial. 0 not checked. [2019-09-08 01:22:36,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:36,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 148] total 148 [2019-09-08 01:22:36,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-08 01:22:36,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-08 01:22:36,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-08 01:22:36,168 INFO L87 Difference]: Start difference. First operand 738 states and 1027 transitions. Second operand 148 states. [2019-09-08 01:22:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:40,595 INFO L93 Difference]: Finished difference Result 752 states and 1045 transitions. [2019-09-08 01:22:40,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-08 01:22:40,596 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 1025 [2019-09-08 01:22:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:40,597 INFO L225 Difference]: With dead ends: 752 [2019-09-08 01:22:40,597 INFO L226 Difference]: Without dead ends: 747 [2019-09-08 01:22:40,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1172 GetRequests, 1026 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-08 01:22:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-09-08 01:22:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 743. [2019-09-08 01:22:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-09-08 01:22:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1034 transitions. [2019-09-08 01:22:40,606 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1034 transitions. Word has length 1025 [2019-09-08 01:22:40,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:40,607 INFO L475 AbstractCegarLoop]: Abstraction has 743 states and 1034 transitions. [2019-09-08 01:22:40,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-08 01:22:40,607 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1034 transitions. [2019-09-08 01:22:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2019-09-08 01:22:40,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:40,617 INFO L399 BasicCegarLoop]: trace histogram [146, 146, 146, 146, 146, 146, 146, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:40,617 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:40,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:40,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1520846577, now seen corresponding path program 146 times [2019-09-08 01:22:40,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:40,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:40,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:40,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:22:40,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 74241 backedges. 0 proven. 53071 refuted. 0 times theorem prover too weak. 21170 trivial. 0 not checked. [2019-09-08 01:22:48,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:48,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:48,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:22:49,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:22:49,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:49,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 2650 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-08 01:22:49,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 74241 backedges. 0 proven. 53071 refuted. 0 times theorem prover too weak. 21170 trivial. 0 not checked. [2019-09-08 01:22:49,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:49,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2019-09-08 01:22:49,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-08 01:22:49,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-08 01:22:49,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-08 01:22:49,598 INFO L87 Difference]: Start difference. First operand 743 states and 1034 transitions. Second operand 149 states. [2019-09-08 01:22:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:52,559 INFO L93 Difference]: Finished difference Result 757 states and 1052 transitions. [2019-09-08 01:22:52,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 01:22:52,559 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 1032 [2019-09-08 01:22:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:52,561 INFO L225 Difference]: With dead ends: 757 [2019-09-08 01:22:52,561 INFO L226 Difference]: Without dead ends: 752 [2019-09-08 01:22:52,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 1033 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-08 01:22:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-08 01:22:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 748. [2019-09-08 01:22:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-09-08 01:22:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1041 transitions. [2019-09-08 01:22:52,570 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1041 transitions. Word has length 1032 [2019-09-08 01:22:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:52,570 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1041 transitions. [2019-09-08 01:22:52,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-08 01:22:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1041 transitions. [2019-09-08 01:22:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2019-09-08 01:22:52,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:52,577 INFO L399 BasicCegarLoop]: trace histogram [147, 147, 147, 147, 147, 147, 147, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:52,577 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:52,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:52,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1050119078, now seen corresponding path program 147 times [2019-09-08 01:22:52,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:52,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:52,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 75264 backedges. 0 proven. 53802 refuted. 0 times theorem prover too weak. 21462 trivial. 0 not checked. [2019-09-08 01:23:00,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:00,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:00,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:23:01,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 148 check-sat command(s) [2019-09-08 01:23:01,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:01,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 2668 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-08 01:23:01,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 75264 backedges. 0 proven. 53802 refuted. 0 times theorem prover too weak. 21462 trivial. 0 not checked. [2019-09-08 01:23:02,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:02,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 150] total 150 [2019-09-08 01:23:02,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-08 01:23:02,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-08 01:23:02,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-08 01:23:02,179 INFO L87 Difference]: Start difference. First operand 748 states and 1041 transitions. Second operand 150 states. [2019-09-08 01:23:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:05,622 INFO L93 Difference]: Finished difference Result 762 states and 1059 transitions. [2019-09-08 01:23:05,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-08 01:23:05,622 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 1039 [2019-09-08 01:23:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:05,624 INFO L225 Difference]: With dead ends: 762 [2019-09-08 01:23:05,624 INFO L226 Difference]: Without dead ends: 757 [2019-09-08 01:23:05,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 1040 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-08 01:23:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-09-08 01:23:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 753. [2019-09-08 01:23:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-09-08 01:23:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1048 transitions. [2019-09-08 01:23:05,635 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1048 transitions. Word has length 1039 [2019-09-08 01:23:05,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:05,635 INFO L475 AbstractCegarLoop]: Abstraction has 753 states and 1048 transitions. [2019-09-08 01:23:05,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-08 01:23:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1048 transitions. [2019-09-08 01:23:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2019-09-08 01:23:05,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:05,642 INFO L399 BasicCegarLoop]: trace histogram [148, 148, 148, 148, 148, 148, 148, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:05,642 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:05,643 INFO L82 PathProgramCache]: Analyzing trace with hash -861597999, now seen corresponding path program 148 times [2019-09-08 01:23:05,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:05,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:05,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat