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/feedback_diverge.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:10:48,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:10:48,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:10:48,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:10:48,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:10:48,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:10:48,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:10:48,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:10:48,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:10:48,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:10:48,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:10:48,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:10:48,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:10:48,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:10:48,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:10:48,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:10:48,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:10:48,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:10:48,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:10:48,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:10:48,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:10:48,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:10:48,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:10:48,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:10:48,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:10:48,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:10:48,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:10:48,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:10:48,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:10:48,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:10:48,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:10:48,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:10:48,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:10:48,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:10:48,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:10:48,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:10:48,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:10:48,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:10:48,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:10:48,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:10:48,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:10:48,419 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:48,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:10:48,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:10:48,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:10:48,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:10:48,435 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:10:48,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:10:48,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:10:48,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:10:48,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:10:48,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:10:48,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:10:48,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:10:48,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:10:48,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:10:48,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:10:48,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:10:48,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:10:48,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:10:48,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:10:48,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:10:48,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:10:48,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:10:48,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:10:48,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:10:48,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:10:48,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:10:48,439 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:10:48,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:10:48,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:10:48,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:10:48,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:10:48,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:10:48,485 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:10:48,485 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:10:48,486 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/feedback_diverge.c [2019-09-08 01:10:48,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65814dab6/81d9ec88545d42068daaea6c4908feb0/FLAGeec12caea [2019-09-08 01:10:48,989 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:10:48,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/feedback_diverge.c [2019-09-08 01:10:49,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65814dab6/81d9ec88545d42068daaea6c4908feb0/FLAGeec12caea [2019-09-08 01:10:49,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65814dab6/81d9ec88545d42068daaea6c4908feb0 [2019-09-08 01:10:49,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:10:49,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:10:49,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:49,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:10:49,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:10:49,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:49" (1/1) ... [2019-09-08 01:10:49,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3ba2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:49, skipping insertion in model container [2019-09-08 01:10:49,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:49" (1/1) ... [2019-09-08 01:10:49,389 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:10:49,408 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:10:49,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:49,583 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:10:49,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:49,614 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:10:49,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:49 WrapperNode [2019-09-08 01:10:49,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:49,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:10:49,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:10:49,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:10:49,720 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:49" (1/1) ... [2019-09-08 01:10:49,721 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:49" (1/1) ... [2019-09-08 01:10:49,726 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:49" (1/1) ... [2019-09-08 01:10:49,726 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:49" (1/1) ... [2019-09-08 01:10:49,731 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:49" (1/1) ... [2019-09-08 01:10:49,735 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:49" (1/1) ... [2019-09-08 01:10:49,736 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:49" (1/1) ... [2019-09-08 01:10:49,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:10:49,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:10:49,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:10:49,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:10:49,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:49" (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:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:10:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:10:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 01:10:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_clock [2019-09-08 01:10:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:10:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:10:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:10:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2019-09-08 01:10:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 01:10:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 01:10:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_clock [2019-09-08 01:10:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:10:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:10:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:10:49,959 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:10:49,959 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 01:10:49,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:49 BoogieIcfgContainer [2019-09-08 01:10:49,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:10:49,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:10:49,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:10:49,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:10:49,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:10:49" (1/3) ... [2019-09-08 01:10:49,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706d0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:49, skipping insertion in model container [2019-09-08 01:10:49,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:49" (2/3) ... [2019-09-08 01:10:49,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706d0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:49, skipping insertion in model container [2019-09-08 01:10:49,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:49" (3/3) ... [2019-09-08 01:10:49,968 INFO L109 eAbstractionObserver]: Analyzing ICFG feedback_diverge.c [2019-09-08 01:10:49,978 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:10:49,986 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:10:50,003 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:10:50,057 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:10:50,058 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:10:50,058 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:10:50,058 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:10:50,059 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:10:50,059 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:10:50,059 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:10:50,059 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:10:50,059 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:10:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-08 01:10:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:10:50,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:50,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:50,092 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1082648863, now seen corresponding path program 1 times [2019-09-08 01:10:50,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:50,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:50,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:50,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:50,209 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:50,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:10:50,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:10:50,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:10:50,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:10:50,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:10:50,231 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-08 01:10:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:50,251 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-09-08 01:10:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:10:50,252 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-08 01:10:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:50,261 INFO L225 Difference]: With dead ends: 36 [2019-09-08 01:10:50,262 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 01:10:50,265 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:50,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 01:10:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 01:10:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 01:10:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-08 01:10:50,304 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2019-09-08 01:10:50,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:50,304 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-08 01:10:50,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:10:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-08 01:10:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:10:50,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:50,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:50,306 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1069719569, now seen corresponding path program 1 times [2019-09-08 01:10:50,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:50,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:50,350 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:50,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:10:50,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:10:50,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:10:50,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:10:50,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:10:50,353 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2019-09-08 01:10:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:50,389 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-09-08 01:10:50,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:10:50,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-08 01:10:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:50,391 INFO L225 Difference]: With dead ends: 27 [2019-09-08 01:10:50,391 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:10:50,392 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:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:10:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-09-08 01:10:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 01:10:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-08 01:10:50,402 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2019-09-08 01:10:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:50,403 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-08 01:10:50,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:10:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-08 01:10:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 01:10:50,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:50,404 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:50,404 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:50,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1770755898, now seen corresponding path program 1 times [2019-09-08 01:10:50,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:50,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:50,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:50,453 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:50,453 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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:50,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:50,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:10:50,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:50,529 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:50,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:50,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-08 01:10:50,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:10:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:10:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:50,535 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-09-08 01:10:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:50,578 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-09-08 01:10:50,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:10:50,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-08 01:10:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:50,580 INFO L225 Difference]: With dead ends: 32 [2019-09-08 01:10:50,580 INFO L226 Difference]: Without dead ends: 27 [2019-09-08 01:10:50,581 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:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-08 01:10:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-09-08 01:10:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:10:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-08 01:10:50,588 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2019-09-08 01:10:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:50,589 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-08 01:10:50,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:10:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-08 01:10:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:10:50,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:50,591 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:50,592 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash 337571825, now seen corresponding path program 2 times [2019-09-08 01:10:50,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:50,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:50,669 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:50,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:50,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:50,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:50,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:50,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:50,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:10:50,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 01:10:50,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:50,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-08 01:10:50,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:10:50,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:10:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:10:50,737 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2019-09-08 01:10:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:50,780 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-08 01:10:50,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:10:50,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-08 01:10:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:50,781 INFO L225 Difference]: With dead ends: 37 [2019-09-08 01:10:50,782 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 01:10:50,782 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:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 01:10:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-09-08 01:10:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 01:10:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-09-08 01:10:50,790 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 24 [2019-09-08 01:10:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:50,790 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-09-08 01:10:50,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:10:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-09-08 01:10:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 01:10:50,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:50,792 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:50,792 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1752192166, now seen corresponding path program 3 times [2019-09-08 01:10:50,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:50,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:50,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:50,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:50,862 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:50,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:50,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:50,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:50,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 01:10:50,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:50,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:10:50,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:50,925 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:50,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:50,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 01:10:50,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:10:50,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:10:50,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:50,932 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 6 states. [2019-09-08 01:10:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:50,986 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-08 01:10:50,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:10:50,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-09-08 01:10:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:50,988 INFO L225 Difference]: With dead ends: 42 [2019-09-08 01:10:50,988 INFO L226 Difference]: Without dead ends: 37 [2019-09-08 01:10:50,989 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:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-08 01:10:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-09-08 01:10:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 01:10:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-09-08 01:10:50,996 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2019-09-08 01:10:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:50,997 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-09-08 01:10:50,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:10:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-09-08 01:10:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 01:10:50,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:50,999 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:50,999 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1833039825, now seen corresponding path program 4 times [2019-09-08 01:10:51,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:51,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:51,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:51,092 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:51,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:51,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:51,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:51,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:51,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:51,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:10:51,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:51,173 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:51,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:51,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 01:10:51,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:10:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:10:51,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:51,188 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 7 states. [2019-09-08 01:10:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:51,233 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-09-08 01:10:51,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:10:51,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-09-08 01:10:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:51,239 INFO L225 Difference]: With dead ends: 47 [2019-09-08 01:10:51,239 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 01:10:51,240 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:51,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 01:10:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-09-08 01:10:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-08 01:10:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2019-09-08 01:10:51,247 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 38 [2019-09-08 01:10:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:51,248 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-09-08 01:10:51,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:10:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2019-09-08 01:10:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 01:10:51,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:51,250 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:51,250 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1313736570, now seen corresponding path program 5 times [2019-09-08 01:10:51,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:51,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:51,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:51,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:51,391 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:51,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:51,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:51,407 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:51,436 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 01:10:51,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:51,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 01:10:51,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:51,453 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:51,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:51,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-08 01:10:51,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:10:51,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:10:51,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:51,461 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 8 states. [2019-09-08 01:10:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:51,540 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2019-09-08 01:10:51,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:10:51,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-09-08 01:10:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:51,542 INFO L225 Difference]: With dead ends: 52 [2019-09-08 01:10:51,542 INFO L226 Difference]: Without dead ends: 47 [2019-09-08 01:10:51,543 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:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-08 01:10:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-09-08 01:10:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 01:10:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-09-08 01:10:51,551 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 45 [2019-09-08 01:10:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:51,552 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-09-08 01:10:51,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:10:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2019-09-08 01:10:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 01:10:51,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:51,554 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:51,554 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:51,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash 755611569, now seen corresponding path program 6 times [2019-09-08 01:10:51,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:51,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:51,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:51,671 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:51,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:51,672 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:51,700 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:51,747 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 01:10:51,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:51,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:10:51,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:51,780 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:51,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:51,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 01:10:51,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:10:51,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:10:51,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:51,795 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 9 states. [2019-09-08 01:10:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:51,883 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2019-09-08 01:10:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:10:51,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-08 01:10:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:51,886 INFO L225 Difference]: With dead ends: 57 [2019-09-08 01:10:51,887 INFO L226 Difference]: Without dead ends: 52 [2019-09-08 01:10:51,887 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:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-08 01:10:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2019-09-08 01:10:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 01:10:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-09-08 01:10:51,907 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 52 [2019-09-08 01:10:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:51,908 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-09-08 01:10:51,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:10:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2019-09-08 01:10:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 01:10:51,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:51,915 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:51,916 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:51,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1982376858, now seen corresponding path program 7 times [2019-09-08 01:10:51,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:51,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:51,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:51,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:52,065 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:52,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:52,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:52,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:52,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:10:52,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:52,131 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:52,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:52,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-08 01:10:52,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:10:52,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:10:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:10:52,138 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 10 states. [2019-09-08 01:10:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:52,221 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2019-09-08 01:10:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:10:52,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-09-08 01:10:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:52,223 INFO L225 Difference]: With dead ends: 62 [2019-09-08 01:10:52,224 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 01:10:52,224 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:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 01:10:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-09-08 01:10:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 01:10:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2019-09-08 01:10:52,232 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 59 [2019-09-08 01:10:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:52,233 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2019-09-08 01:10:52,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:10:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2019-09-08 01:10:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 01:10:52,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:52,235 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:52,235 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:52,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1730924655, now seen corresponding path program 8 times [2019-09-08 01:10:52,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:52,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:52,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:52,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:52,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:52,371 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:52,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:52,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:52,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:52,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:52,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:52,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:10:52,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:52,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:52,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 01:10:52,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:10:52,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:10:52,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:10:52,461 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand 11 states. [2019-09-08 01:10:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:52,546 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-09-08 01:10:52,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:10:52,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-09-08 01:10:52,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:52,549 INFO L225 Difference]: With dead ends: 67 [2019-09-08 01:10:52,549 INFO L226 Difference]: Without dead ends: 62 [2019-09-08 01:10:52,550 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:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-08 01:10:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2019-09-08 01:10:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 01:10:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2019-09-08 01:10:52,569 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 66 [2019-09-08 01:10:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:52,572 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2019-09-08 01:10:52,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:10:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2019-09-08 01:10:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 01:10:52,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:52,576 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:52,576 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:52,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:52,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1543399494, now seen corresponding path program 9 times [2019-09-08 01:10:52,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:52,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:52,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:52,731 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:52,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:52,731 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:52,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:52,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 01:10:52,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:52,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:10:52,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:52,813 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:52,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:52,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-08 01:10:52,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:10:52,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:10:52,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:10:52,824 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand 12 states. [2019-09-08 01:10:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:52,976 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2019-09-08 01:10:52,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:10:52,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 01:10:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:52,978 INFO L225 Difference]: With dead ends: 72 [2019-09-08 01:10:52,978 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 01:10:52,979 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:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 01:10:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-09-08 01:10:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 01:10:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2019-09-08 01:10:52,987 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 73 [2019-09-08 01:10:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:52,987 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2019-09-08 01:10:52,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:10:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2019-09-08 01:10:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 01:10:52,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:52,989 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:52,990 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash 964648817, now seen corresponding path program 10 times [2019-09-08 01:10:52,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:52,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:52,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:52,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:53,171 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:53,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:53,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:53,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:53,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:53,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:53,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 01:10:53,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-08 01:10:53,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:53,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-08 01:10:53,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:10:53,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:10:53,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:10:53,256 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 13 states. [2019-09-08 01:10:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:53,365 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2019-09-08 01:10:53,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:10:53,366 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-09-08 01:10:53,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:53,367 INFO L225 Difference]: With dead ends: 77 [2019-09-08 01:10:53,367 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 01:10:53,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:10:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 01:10:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-09-08 01:10:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-08 01:10:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2019-09-08 01:10:53,375 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 80 [2019-09-08 01:10:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:53,376 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2019-09-08 01:10:53,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:10:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2019-09-08 01:10:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 01:10:53,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:53,378 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:53,378 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash 960154586, now seen corresponding path program 11 times [2019-09-08 01:10:53,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:53,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:53,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:53,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:53,549 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:53,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:53,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:53,567 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:53,611 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 01:10:53,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:53,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:10:53,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:53,654 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:53,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:53,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-08 01:10:53,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:10:53,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:10:53,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:10:53,663 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand 14 states. [2019-09-08 01:10:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:53,775 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2019-09-08 01:10:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 01:10:53,777 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2019-09-08 01:10:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:53,779 INFO L225 Difference]: With dead ends: 82 [2019-09-08 01:10:53,779 INFO L226 Difference]: Without dead ends: 77 [2019-09-08 01:10:53,780 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:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-08 01:10:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2019-09-08 01:10:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-08 01:10:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2019-09-08 01:10:53,795 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 87 [2019-09-08 01:10:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:53,795 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2019-09-08 01:10:53,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:10:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2019-09-08 01:10:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 01:10:53,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:53,798 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:53,798 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1150728367, now seen corresponding path program 12 times [2019-09-08 01:10:53,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:53,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:53,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:53,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:53,971 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:53,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:53,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:53,989 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:54,033 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 01:10:54,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:54,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 01:10:54,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:54,092 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:54,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:54,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-08 01:10:54,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 01:10:54,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 01:10:54,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:10:54,104 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand 15 states. [2019-09-08 01:10:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:54,228 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2019-09-08 01:10:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 01:10:54,229 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2019-09-08 01:10:54,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:54,230 INFO L225 Difference]: With dead ends: 87 [2019-09-08 01:10:54,230 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 01:10:54,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:10:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 01:10:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-09-08 01:10:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-08 01:10:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2019-09-08 01:10:54,241 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 94 [2019-09-08 01:10:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:54,242 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2019-09-08 01:10:54,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 01:10:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2019-09-08 01:10:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 01:10:54,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:54,245 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:54,245 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2085206022, now seen corresponding path program 13 times [2019-09-08 01:10:54,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:54,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:54,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:54,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:54,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:54,431 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:54,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:54,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:54,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:54,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 01:10:54,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:54,538 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:54,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:54,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-08 01:10:54,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 01:10:54,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 01:10:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:10:54,555 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand 16 states. [2019-09-08 01:10:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:54,676 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2019-09-08 01:10:54,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 01:10:54,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 101 [2019-09-08 01:10:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:54,678 INFO L225 Difference]: With dead ends: 92 [2019-09-08 01:10:54,678 INFO L226 Difference]: Without dead ends: 87 [2019-09-08 01:10:54,679 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:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-08 01:10:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-09-08 01:10:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-08 01:10:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2019-09-08 01:10:54,693 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 101 [2019-09-08 01:10:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:54,693 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2019-09-08 01:10:54,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 01:10:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2019-09-08 01:10:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 01:10:54,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:54,696 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:54,697 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:54,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash -831527119, now seen corresponding path program 14 times [2019-09-08 01:10:54,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:54,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:54,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:54,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:54,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:54,887 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:54,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:54,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:54,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:54,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:54,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:54,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 01:10:54,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:54,995 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:55,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:55,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-08 01:10:55,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 01:10:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 01:10:55,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:10:55,012 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand 17 states. [2019-09-08 01:10:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:55,147 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2019-09-08 01:10:55,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 01:10:55,148 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 108 [2019-09-08 01:10:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:55,149 INFO L225 Difference]: With dead ends: 97 [2019-09-08 01:10:55,149 INFO L226 Difference]: Without dead ends: 92 [2019-09-08 01:10:55,152 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:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-08 01:10:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-09-08 01:10:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-08 01:10:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2019-09-08 01:10:55,163 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 108 [2019-09-08 01:10:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:55,164 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2019-09-08 01:10:55,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 01:10:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2019-09-08 01:10:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 01:10:55,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:55,169 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:55,169 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:55,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:55,170 INFO L82 PathProgramCache]: Analyzing trace with hash -573174758, now seen corresponding path program 15 times [2019-09-08 01:10:55,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:55,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:55,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:55,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:55,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:55,380 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:55,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:55,380 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) [2019-09-08 01:10:55,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:55,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-08 01:10:55,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:55,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 01:10:55,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:55,500 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:55,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:55,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-08 01:10:55,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 01:10:55,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 01:10:55,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:10:55,516 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand 18 states. [2019-09-08 01:10:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:55,684 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2019-09-08 01:10:55,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 01:10:55,685 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2019-09-08 01:10:55,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:55,686 INFO L225 Difference]: With dead ends: 102 [2019-09-08 01:10:55,686 INFO L226 Difference]: Without dead ends: 97 [2019-09-08 01:10:55,687 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:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-08 01:10:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-09-08 01:10:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-08 01:10:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-09-08 01:10:55,692 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 115 [2019-09-08 01:10:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:55,693 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-09-08 01:10:55,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 01:10:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-09-08 01:10:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 01:10:55,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:55,695 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:55,695 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash 99696401, now seen corresponding path program 16 times [2019-09-08 01:10:55,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:55,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:55,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:55,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:55,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:55,892 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:55,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:55,893 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:55,904 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:55,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:55,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:55,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 01:10:55,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:55,992 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:56,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:56,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-08 01:10:56,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 01:10:56,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 01:10:56,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:10:56,004 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 19 states. [2019-09-08 01:10:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:56,189 INFO L93 Difference]: Finished difference Result 107 states and 142 transitions. [2019-09-08 01:10:56,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 01:10:56,191 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 122 [2019-09-08 01:10:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:56,193 INFO L225 Difference]: With dead ends: 107 [2019-09-08 01:10:56,193 INFO L226 Difference]: Without dead ends: 102 [2019-09-08 01:10:56,194 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:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-08 01:10:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2019-09-08 01:10:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-08 01:10:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 131 transitions. [2019-09-08 01:10:56,200 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 131 transitions. Word has length 122 [2019-09-08 01:10:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:56,201 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 131 transitions. [2019-09-08 01:10:56,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 01:10:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 131 transitions. [2019-09-08 01:10:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 01:10:56,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:56,203 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:56,203 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash -830728134, now seen corresponding path program 17 times [2019-09-08 01:10:56,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:56,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:56,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:56,401 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:56,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:56,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:56,415 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:56,475 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-08 01:10:56,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:56,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 01:10:56,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:56,505 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:56,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:56,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-08 01:10:56,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 01:10:56,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 01:10:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:10:56,517 INFO L87 Difference]: Start difference. First operand 98 states and 131 transitions. Second operand 20 states. [2019-09-08 01:10:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:56,672 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2019-09-08 01:10:56,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:10:56,673 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 129 [2019-09-08 01:10:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:56,674 INFO L225 Difference]: With dead ends: 112 [2019-09-08 01:10:56,674 INFO L226 Difference]: Without dead ends: 107 [2019-09-08 01:10:56,675 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:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-08 01:10:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-09-08 01:10:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-08 01:10:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 138 transitions. [2019-09-08 01:10:56,685 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 138 transitions. Word has length 129 [2019-09-08 01:10:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:56,686 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 138 transitions. [2019-09-08 01:10:56,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 01:10:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 138 transitions. [2019-09-08 01:10:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 01:10:56,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:56,688 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:56,688 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1194635535, now seen corresponding path program 18 times [2019-09-08 01:10:56,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:56,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:56,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:56,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:56,940 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:56,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:56,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:56,955 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:57,014 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 01:10:57,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:57,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 01:10:57,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:57,043 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:57,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:57,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-08 01:10:57,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 01:10:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 01:10:57,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:10:57,049 INFO L87 Difference]: Start difference. First operand 103 states and 138 transitions. Second operand 21 states. [2019-09-08 01:10:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:57,185 INFO L93 Difference]: Finished difference Result 117 states and 156 transitions. [2019-09-08 01:10:57,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:10:57,185 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 136 [2019-09-08 01:10:57,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:57,187 INFO L225 Difference]: With dead ends: 117 [2019-09-08 01:10:57,187 INFO L226 Difference]: Without dead ends: 112 [2019-09-08 01:10:57,188 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:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-08 01:10:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-09-08 01:10:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-08 01:10:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2019-09-08 01:10:57,193 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 136 [2019-09-08 01:10:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:57,194 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2019-09-08 01:10:57,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 01:10:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2019-09-08 01:10:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 01:10:57,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:57,196 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:57,196 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:57,197 INFO L82 PathProgramCache]: Analyzing trace with hash 688548954, now seen corresponding path program 19 times [2019-09-08 01:10:57,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:57,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:57,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:57,416 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:57,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:57,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:57,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:57,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 01:10:57,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:57,518 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:57,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:57,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-08 01:10:57,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 01:10:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 01:10:57,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:10:57,526 INFO L87 Difference]: Start difference. First operand 108 states and 145 transitions. Second operand 22 states. [2019-09-08 01:10:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:57,737 INFO L93 Difference]: Finished difference Result 122 states and 163 transitions. [2019-09-08 01:10:57,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 01:10:57,743 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 143 [2019-09-08 01:10:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:57,745 INFO L225 Difference]: With dead ends: 122 [2019-09-08 01:10:57,745 INFO L226 Difference]: Without dead ends: 117 [2019-09-08 01:10:57,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:10:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-08 01:10:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-09-08 01:10:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-08 01:10:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2019-09-08 01:10:57,751 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 143 [2019-09-08 01:10:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:57,752 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2019-09-08 01:10:57,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 01:10:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2019-09-08 01:10:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 01:10:57,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:57,753 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:57,753 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:57,754 INFO L82 PathProgramCache]: Analyzing trace with hash -514058543, now seen corresponding path program 20 times [2019-09-08 01:10:57,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:57,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:57,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:58,001 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:58,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:58,002 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:58,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:58,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:58,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:58,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 01:10:58,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:58,098 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:58,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:58,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-08 01:10:58,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 01:10:58,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 01:10:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:10:58,104 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand 23 states. [2019-09-08 01:10:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:58,333 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2019-09-08 01:10:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 01:10:58,335 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 150 [2019-09-08 01:10:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:58,338 INFO L225 Difference]: With dead ends: 127 [2019-09-08 01:10:58,338 INFO L226 Difference]: Without dead ends: 122 [2019-09-08 01:10:58,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:10:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-08 01:10:58,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-09-08 01:10:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-08 01:10:58,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 159 transitions. [2019-09-08 01:10:58,344 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 159 transitions. Word has length 150 [2019-09-08 01:10:58,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:58,345 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 159 transitions. [2019-09-08 01:10:58,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 01:10:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 159 transitions. [2019-09-08 01:10:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 01:10:58,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:58,346 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:58,347 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:58,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:58,347 INFO L82 PathProgramCache]: Analyzing trace with hash 761464954, now seen corresponding path program 21 times [2019-09-08 01:10:58,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:58,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:58,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:58,666 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:58,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:58,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 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:58,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:58,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-08 01:10:58,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:58,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 01:10:58,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:58,773 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:58,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:58,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-08 01:10:58,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 01:10:58,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 01:10:58,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:10:58,779 INFO L87 Difference]: Start difference. First operand 118 states and 159 transitions. Second operand 24 states. [2019-09-08 01:10:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:58,988 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2019-09-08 01:10:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 01:10:58,988 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 157 [2019-09-08 01:10:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:58,992 INFO L225 Difference]: With dead ends: 132 [2019-09-08 01:10:58,992 INFO L226 Difference]: Without dead ends: 127 [2019-09-08 01:10:58,993 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:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-08 01:10:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-09-08 01:10:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-08 01:10:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 166 transitions. [2019-09-08 01:10:59,010 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 166 transitions. Word has length 157 [2019-09-08 01:10:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:59,011 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 166 transitions. [2019-09-08 01:10:59,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 01:10:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 166 transitions. [2019-09-08 01:10:59,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 01:10:59,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:59,015 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:59,015 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:59,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:59,015 INFO L82 PathProgramCache]: Analyzing trace with hash -41838927, now seen corresponding path program 22 times [2019-09-08 01:10:59,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:59,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:59,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:59,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:59,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:59,338 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:59,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:59,339 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:59,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:59,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:59,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:59,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 01:10:59,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:59,453 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:59,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:59,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-08 01:10:59,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 01:10:59,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 01:10:59,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 01:10:59,463 INFO L87 Difference]: Start difference. First operand 123 states and 166 transitions. Second operand 25 states. [2019-09-08 01:10:59,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:59,619 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2019-09-08 01:10:59,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 01:10:59,619 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 164 [2019-09-08 01:10:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:59,621 INFO L225 Difference]: With dead ends: 137 [2019-09-08 01:10:59,622 INFO L226 Difference]: Without dead ends: 132 [2019-09-08 01:10:59,623 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:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-08 01:10:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2019-09-08 01:10:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-08 01:10:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 173 transitions. [2019-09-08 01:10:59,629 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 173 transitions. Word has length 164 [2019-09-08 01:10:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:59,629 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 173 transitions. [2019-09-08 01:10:59,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 01:10:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 173 transitions. [2019-09-08 01:10:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 01:10:59,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:59,637 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:59,638 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:59,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1477972838, now seen corresponding path program 23 times [2019-09-08 01:10:59,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:59,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:59,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:59,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:59,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:59,962 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:59,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:59,962 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:59,973 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:00,048 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-08 01:11:00,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:00,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 01:11:00,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:00,085 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:11:00,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:00,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-08 01:11:00,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 01:11:00,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 01:11:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:11:00,091 INFO L87 Difference]: Start difference. First operand 128 states and 173 transitions. Second operand 26 states. [2019-09-08 01:11:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:00,301 INFO L93 Difference]: Finished difference Result 142 states and 191 transitions. [2019-09-08 01:11:00,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 01:11:00,301 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 171 [2019-09-08 01:11:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:00,302 INFO L225 Difference]: With dead ends: 142 [2019-09-08 01:11:00,303 INFO L226 Difference]: Without dead ends: 137 [2019-09-08 01:11:00,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:11:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-08 01:11:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2019-09-08 01:11:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-08 01:11:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 180 transitions. [2019-09-08 01:11:00,311 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 180 transitions. Word has length 171 [2019-09-08 01:11:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:00,312 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 180 transitions. [2019-09-08 01:11:00,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 01:11:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 180 transitions. [2019-09-08 01:11:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 01:11:00,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:00,314 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:11:00,314 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash -291909999, now seen corresponding path program 24 times [2019-09-08 01:11:00,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:00,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:00,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:00,741 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:11:00,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:00,741 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:11:00,754 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:00,827 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-08 01:11:00,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:00,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 01:11:00,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:00,868 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:11:00,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:00,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-08 01:11:00,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 01:11:00,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 01:11:00,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:11:00,873 INFO L87 Difference]: Start difference. First operand 133 states and 180 transitions. Second operand 27 states. [2019-09-08 01:11:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:01,161 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2019-09-08 01:11:01,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 01:11:01,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 178 [2019-09-08 01:11:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:01,164 INFO L225 Difference]: With dead ends: 147 [2019-09-08 01:11:01,164 INFO L226 Difference]: Without dead ends: 142 [2019-09-08 01:11:01,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:11:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-08 01:11:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-09-08 01:11:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-08 01:11:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 187 transitions. [2019-09-08 01:11:01,170 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 187 transitions. Word has length 178 [2019-09-08 01:11:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:01,171 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 187 transitions. [2019-09-08 01:11:01,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 01:11:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 187 transitions. [2019-09-08 01:11:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 01:11:01,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:01,173 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:11:01,173 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:01,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 293279930, now seen corresponding path program 25 times [2019-09-08 01:11:01,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:01,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:01,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:01,578 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:11:01,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:01,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:11:01,593 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:11:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:01,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 01:11:01,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:01,688 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:11:01,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:01,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-08 01:11:01,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 01:11:01,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 01:11:01,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:11:01,693 INFO L87 Difference]: Start difference. First operand 138 states and 187 transitions. Second operand 28 states. [2019-09-08 01:11:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:01,998 INFO L93 Difference]: Finished difference Result 152 states and 205 transitions. [2019-09-08 01:11:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 01:11:01,999 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 185 [2019-09-08 01:11:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:02,000 INFO L225 Difference]: With dead ends: 152 [2019-09-08 01:11:02,000 INFO L226 Difference]: Without dead ends: 147 [2019-09-08 01:11:02,001 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:11:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-08 01:11:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-09-08 01:11:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-08 01:11:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 194 transitions. [2019-09-08 01:11:02,008 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 194 transitions. Word has length 185 [2019-09-08 01:11:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:02,009 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 194 transitions. [2019-09-08 01:11:02,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 01:11:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 194 transitions. [2019-09-08 01:11:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 01:11:02,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:02,010 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:11:02,011 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash -645742991, now seen corresponding path program 26 times [2019-09-08 01:11:02,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:02,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:02,439 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:11:02,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:02,439 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:11:02,460 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:11:02,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:02,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:02,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 01:11:02,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:02,624 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:11:02,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:02,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-08 01:11:02,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 01:11:02,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 01:11:02,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:11:02,630 INFO L87 Difference]: Start difference. First operand 143 states and 194 transitions. Second operand 29 states. [2019-09-08 01:11:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:02,866 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2019-09-08 01:11:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 01:11:02,867 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 192 [2019-09-08 01:11:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:02,869 INFO L225 Difference]: With dead ends: 157 [2019-09-08 01:11:02,869 INFO L226 Difference]: Without dead ends: 152 [2019-09-08 01:11:02,870 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:11:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-08 01:11:02,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2019-09-08 01:11:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-08 01:11:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 201 transitions. [2019-09-08 01:11:02,877 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 201 transitions. Word has length 192 [2019-09-08 01:11:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:02,878 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 201 transitions. [2019-09-08 01:11:02,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 01:11:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 201 transitions. [2019-09-08 01:11:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 01:11:02,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:02,882 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:11:02,882 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1350660902, now seen corresponding path program 27 times [2019-09-08 01:11:02,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:02,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:02,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:03,377 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:11:03,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:03,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:11:03,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:03,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-08 01:11:03,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:03,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 01:11:03,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:03,570 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:11:03,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:03,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-08 01:11:03,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 01:11:03,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 01:11:03,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:11:03,578 INFO L87 Difference]: Start difference. First operand 148 states and 201 transitions. Second operand 30 states. [2019-09-08 01:11:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:03,895 INFO L93 Difference]: Finished difference Result 162 states and 219 transitions. [2019-09-08 01:11:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 01:11:03,896 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 199 [2019-09-08 01:11:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:03,898 INFO L225 Difference]: With dead ends: 162 [2019-09-08 01:11:03,898 INFO L226 Difference]: Without dead ends: 157 [2019-09-08 01:11:03,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:11:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-08 01:11:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-09-08 01:11:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-08 01:11:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 208 transitions. [2019-09-08 01:11:03,905 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 208 transitions. Word has length 199 [2019-09-08 01:11:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:03,906 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 208 transitions. [2019-09-08 01:11:03,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 01:11:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 208 transitions. [2019-09-08 01:11:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 01:11:03,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:03,908 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:11:03,908 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash 110782033, now seen corresponding path program 28 times [2019-09-08 01:11:03,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:03,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:03,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:03,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:03,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:04,391 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:11:04,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:04,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:11:04,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:04,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:04,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:04,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 01:11:04,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:04,528 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:11:04,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:04,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-08 01:11:04,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 01:11:04,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 01:11:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 01:11:04,534 INFO L87 Difference]: Start difference. First operand 153 states and 208 transitions. Second operand 31 states. [2019-09-08 01:11:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:04,784 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions. [2019-09-08 01:11:04,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 01:11:04,785 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 206 [2019-09-08 01:11:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:04,787 INFO L225 Difference]: With dead ends: 167 [2019-09-08 01:11:04,787 INFO L226 Difference]: Without dead ends: 162 [2019-09-08 01:11:04,788 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:11:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-08 01:11:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2019-09-08 01:11:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-08 01:11:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 215 transitions. [2019-09-08 01:11:04,795 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 215 transitions. Word has length 206 [2019-09-08 01:11:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:04,796 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 215 transitions. [2019-09-08 01:11:04,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 01:11:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 215 transitions. [2019-09-08 01:11:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 01:11:04,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:04,798 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:11:04,798 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:04,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:04,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1277933318, now seen corresponding path program 29 times [2019-09-08 01:11:04,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:04,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:04,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:04,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:04,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:05,519 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:11:05,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:05,519 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:11:05,546 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:05,688 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-08 01:11:05,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:05,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 01:11:05,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:05,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:05,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-08 01:11:05,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 01:11:05,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 01:11:05,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:11:05,789 INFO L87 Difference]: Start difference. First operand 158 states and 215 transitions. Second operand 32 states. [2019-09-08 01:11:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:06,151 INFO L93 Difference]: Finished difference Result 172 states and 233 transitions. [2019-09-08 01:11:06,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 01:11:06,154 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 213 [2019-09-08 01:11:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:06,156 INFO L225 Difference]: With dead ends: 172 [2019-09-08 01:11:06,156 INFO L226 Difference]: Without dead ends: 167 [2019-09-08 01:11:06,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:11:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-08 01:11:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2019-09-08 01:11:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-08 01:11:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 222 transitions. [2019-09-08 01:11:06,163 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 222 transitions. Word has length 213 [2019-09-08 01:11:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:06,165 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 222 transitions. [2019-09-08 01:11:06,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 01:11:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 222 transitions. [2019-09-08 01:11:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 01:11:06,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:06,167 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:11:06,167 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1044462031, now seen corresponding path program 30 times [2019-09-08 01:11:06,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:06,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:06,664 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:11:06,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:06,664 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:11:06,674 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:06,762 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-08 01:11:06,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:06,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 01:11:06,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:06,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:06,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-08 01:11:06,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 01:11:06,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 01:11:06,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:11:06,824 INFO L87 Difference]: Start difference. First operand 163 states and 222 transitions. Second operand 33 states. [2019-09-08 01:11:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:07,129 INFO L93 Difference]: Finished difference Result 177 states and 240 transitions. [2019-09-08 01:11:07,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 01:11:07,130 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 220 [2019-09-08 01:11:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:07,132 INFO L225 Difference]: With dead ends: 177 [2019-09-08 01:11:07,132 INFO L226 Difference]: Without dead ends: 172 [2019-09-08 01:11:07,133 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:11:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-08 01:11:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2019-09-08 01:11:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-08 01:11:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 229 transitions. [2019-09-08 01:11:07,141 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 229 transitions. Word has length 220 [2019-09-08 01:11:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:07,142 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 229 transitions. [2019-09-08 01:11:07,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 01:11:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 229 transitions. [2019-09-08 01:11:07,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 01:11:07,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:07,144 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:11:07,144 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1558072602, now seen corresponding path program 31 times [2019-09-08 01:11:07,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:07,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:07,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:07,873 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:11:07,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:07,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:11:07,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:07,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 01:11:07,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:08,044 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:11:08,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:08,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-08 01:11:08,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 01:11:08,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 01:11:08,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:11:08,051 INFO L87 Difference]: Start difference. First operand 168 states and 229 transitions. Second operand 34 states. [2019-09-08 01:11:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:08,503 INFO L93 Difference]: Finished difference Result 182 states and 247 transitions. [2019-09-08 01:11:08,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 01:11:08,503 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 227 [2019-09-08 01:11:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:08,505 INFO L225 Difference]: With dead ends: 182 [2019-09-08 01:11:08,505 INFO L226 Difference]: Without dead ends: 177 [2019-09-08 01:11:08,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:11:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-08 01:11:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2019-09-08 01:11:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-08 01:11:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 236 transitions. [2019-09-08 01:11:08,513 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 236 transitions. Word has length 227 [2019-09-08 01:11:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:08,513 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 236 transitions. [2019-09-08 01:11:08,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 01:11:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2019-09-08 01:11:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 01:11:08,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:08,515 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:11:08,515 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash 978181649, now seen corresponding path program 32 times [2019-09-08 01:11:08,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:08,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:08,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:08,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:08,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:09,231 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:11:09,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:09,232 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:11:09,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:09,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:09,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:09,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 01:11:09,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:09,443 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:11:09,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:09,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-08 01:11:09,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 01:11:09,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 01:11:09,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:11:09,451 INFO L87 Difference]: Start difference. First operand 173 states and 236 transitions. Second operand 35 states. [2019-09-08 01:11:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:09,857 INFO L93 Difference]: Finished difference Result 187 states and 254 transitions. [2019-09-08 01:11:09,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 01:11:09,858 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 234 [2019-09-08 01:11:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:09,860 INFO L225 Difference]: With dead ends: 187 [2019-09-08 01:11:09,860 INFO L226 Difference]: Without dead ends: 182 [2019-09-08 01:11:09,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:11:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-08 01:11:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2019-09-08 01:11:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-08 01:11:09,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 243 transitions. [2019-09-08 01:11:09,867 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 243 transitions. Word has length 234 [2019-09-08 01:11:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:09,868 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 243 transitions. [2019-09-08 01:11:09,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 01:11:09,868 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 243 transitions. [2019-09-08 01:11:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 01:11:09,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:09,870 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:11:09,870 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:09,870 INFO L82 PathProgramCache]: Analyzing trace with hash 360618298, now seen corresponding path program 33 times [2019-09-08 01:11:09,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:09,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:09,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:09,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:09,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:10,610 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:11:10,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:10,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:11:10,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:10,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-08 01:11:10,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:10,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 01:11:10,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:10,790 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:11:10,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:10,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-08 01:11:10,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 01:11:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 01:11:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:11:10,796 INFO L87 Difference]: Start difference. First operand 178 states and 243 transitions. Second operand 36 states. [2019-09-08 01:11:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:11,140 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2019-09-08 01:11:11,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 01:11:11,143 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 241 [2019-09-08 01:11:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:11,145 INFO L225 Difference]: With dead ends: 192 [2019-09-08 01:11:11,146 INFO L226 Difference]: Without dead ends: 187 [2019-09-08 01:11:11,146 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:11:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-08 01:11:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2019-09-08 01:11:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-08 01:11:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 250 transitions. [2019-09-08 01:11:11,153 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 250 transitions. Word has length 241 [2019-09-08 01:11:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:11,153 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 250 transitions. [2019-09-08 01:11:11,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 01:11:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2019-09-08 01:11:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 01:11:11,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:11,155 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:11:11,155 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:11,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1663413745, now seen corresponding path program 34 times [2019-09-08 01:11:11,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:11,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:11,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:11,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:11,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:11,713 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:11,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:11,713 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:11,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:11,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:11,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:11,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 01:11:11,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:11,857 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:11,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:11,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-08 01:11:11,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 01:11:11,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 01:11:11,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:11:11,864 INFO L87 Difference]: Start difference. First operand 183 states and 250 transitions. Second operand 37 states. [2019-09-08 01:11:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:12,224 INFO L93 Difference]: Finished difference Result 197 states and 268 transitions. [2019-09-08 01:11:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 01:11:12,225 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 248 [2019-09-08 01:11:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:12,227 INFO L225 Difference]: With dead ends: 197 [2019-09-08 01:11:12,227 INFO L226 Difference]: Without dead ends: 192 [2019-09-08 01:11:12,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:11:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-08 01:11:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2019-09-08 01:11:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-08 01:11:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 257 transitions. [2019-09-08 01:11:12,251 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 257 transitions. Word has length 248 [2019-09-08 01:11:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:12,254 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 257 transitions. [2019-09-08 01:11:12,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 01:11:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 257 transitions. [2019-09-08 01:11:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 01:11:12,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:12,256 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:12,256 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:12,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1793643174, now seen corresponding path program 35 times [2019-09-08 01:11:12,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:12,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:12,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:12,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:12,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:12,913 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:12,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:12,914 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:12,926 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:13,044 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-08 01:11:13,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:13,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 01:11:13,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:13,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:13,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-08 01:11:13,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 01:11:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 01:11:13,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 01:11:13,127 INFO L87 Difference]: Start difference. First operand 188 states and 257 transitions. Second operand 38 states. [2019-09-08 01:11:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:13,643 INFO L93 Difference]: Finished difference Result 202 states and 275 transitions. [2019-09-08 01:11:13,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 01:11:13,644 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 255 [2019-09-08 01:11:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:13,645 INFO L225 Difference]: With dead ends: 202 [2019-09-08 01:11:13,646 INFO L226 Difference]: Without dead ends: 197 [2019-09-08 01:11:13,646 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:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-08 01:11:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2019-09-08 01:11:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-08 01:11:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-09-08 01:11:13,654 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 255 [2019-09-08 01:11:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:13,656 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-09-08 01:11:13,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 01:11:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-09-08 01:11:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 01:11:13,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:13,659 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:13,659 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:13,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:13,659 INFO L82 PathProgramCache]: Analyzing trace with hash -760990255, now seen corresponding path program 36 times [2019-09-08 01:11:13,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:13,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:13,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:14,335 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:14,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:14,335 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) [2019-09-08 01:11:14,366 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:14,471 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-08 01:11:14,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:14,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 01:11:14,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4446 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:14,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:14,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-08 01:11:14,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 01:11:14,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 01:11:14,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:11:14,550 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 39 states. [2019-09-08 01:11:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:14,864 INFO L93 Difference]: Finished difference Result 207 states and 282 transitions. [2019-09-08 01:11:14,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 01:11:14,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 262 [2019-09-08 01:11:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:14,867 INFO L225 Difference]: With dead ends: 207 [2019-09-08 01:11:14,867 INFO L226 Difference]: Without dead ends: 202 [2019-09-08 01:11:14,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:11:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-08 01:11:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2019-09-08 01:11:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-08 01:11:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 271 transitions. [2019-09-08 01:11:14,875 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 271 transitions. Word has length 262 [2019-09-08 01:11:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:14,876 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 271 transitions. [2019-09-08 01:11:14,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 01:11:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 271 transitions. [2019-09-08 01:11:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 01:11:14,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:14,878 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:14,879 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash -7730822, now seen corresponding path program 37 times [2019-09-08 01:11:14,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:14,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:14,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:14,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:14,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:15,606 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:15,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:15,606 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:15,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:15,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 01:11:15,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:15,773 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:15,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:15,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-08 01:11:15,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 01:11:15,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 01:11:15,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:11:15,779 INFO L87 Difference]: Start difference. First operand 198 states and 271 transitions. Second operand 40 states. [2019-09-08 01:11:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:16,251 INFO L93 Difference]: Finished difference Result 212 states and 289 transitions. [2019-09-08 01:11:16,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 01:11:16,251 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 269 [2019-09-08 01:11:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:16,253 INFO L225 Difference]: With dead ends: 212 [2019-09-08 01:11:16,253 INFO L226 Difference]: Without dead ends: 207 [2019-09-08 01:11:16,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:11:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-08 01:11:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-09-08 01:11:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-08 01:11:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 278 transitions. [2019-09-08 01:11:16,261 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 278 transitions. Word has length 269 [2019-09-08 01:11:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:16,262 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 278 transitions. [2019-09-08 01:11:16,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 01:11:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 278 transitions. [2019-09-08 01:11:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 01:11:16,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:16,264 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:16,264 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:16,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1566083663, now seen corresponding path program 38 times [2019-09-08 01:11:16,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:16,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:16,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:16,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:16,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:16,963 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:16,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:16,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:16,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:17,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:17,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:17,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 01:11:17,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:17,160 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:17,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:17,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-08 01:11:17,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 01:11:17,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 01:11:17,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:11:17,168 INFO L87 Difference]: Start difference. First operand 203 states and 278 transitions. Second operand 41 states. [2019-09-08 01:11:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:17,577 INFO L93 Difference]: Finished difference Result 217 states and 296 transitions. [2019-09-08 01:11:17,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 01:11:17,577 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 276 [2019-09-08 01:11:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:17,579 INFO L225 Difference]: With dead ends: 217 [2019-09-08 01:11:17,579 INFO L226 Difference]: Without dead ends: 212 [2019-09-08 01:11:17,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:11:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-08 01:11:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2019-09-08 01:11:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-08 01:11:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 285 transitions. [2019-09-08 01:11:17,587 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 285 transitions. Word has length 276 [2019-09-08 01:11:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:17,587 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 285 transitions. [2019-09-08 01:11:17,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 01:11:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 285 transitions. [2019-09-08 01:11:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 01:11:17,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:17,589 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:17,590 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash 87633306, now seen corresponding path program 39 times [2019-09-08 01:11:17,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:17,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:17,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:17,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:17,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:18,588 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:18,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:18,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:18,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:18,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-08 01:11:18,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:18,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 01:11:18,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5226 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:18,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:18,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-08 01:11:18,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 01:11:18,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 01:11:18,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:11:18,797 INFO L87 Difference]: Start difference. First operand 208 states and 285 transitions. Second operand 42 states. [2019-09-08 01:11:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:19,189 INFO L93 Difference]: Finished difference Result 222 states and 303 transitions. [2019-09-08 01:11:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 01:11:19,192 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 283 [2019-09-08 01:11:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:19,196 INFO L225 Difference]: With dead ends: 222 [2019-09-08 01:11:19,196 INFO L226 Difference]: Without dead ends: 217 [2019-09-08 01:11:19,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:11:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-08 01:11:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2019-09-08 01:11:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-08 01:11:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 292 transitions. [2019-09-08 01:11:19,205 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 292 transitions. Word has length 283 [2019-09-08 01:11:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:19,206 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 292 transitions. [2019-09-08 01:11:19,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 01:11:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 292 transitions. [2019-09-08 01:11:19,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-08 01:11:19,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:19,208 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:19,209 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:19,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1351445905, now seen corresponding path program 40 times [2019-09-08 01:11:19,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:19,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:20,182 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:20,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:20,182 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:20,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:20,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:20,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:20,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 01:11:20,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:20,345 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:20,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:20,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-08 01:11:20,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 01:11:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 01:11:20,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:11:20,351 INFO L87 Difference]: Start difference. First operand 213 states and 292 transitions. Second operand 43 states. [2019-09-08 01:11:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:21,078 INFO L93 Difference]: Finished difference Result 227 states and 310 transitions. [2019-09-08 01:11:21,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 01:11:21,079 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 290 [2019-09-08 01:11:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:21,082 INFO L225 Difference]: With dead ends: 227 [2019-09-08 01:11:21,082 INFO L226 Difference]: Without dead ends: 222 [2019-09-08 01:11:21,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:11:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-08 01:11:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2019-09-08 01:11:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-08 01:11:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 299 transitions. [2019-09-08 01:11:21,095 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 299 transitions. Word has length 290 [2019-09-08 01:11:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:21,096 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 299 transitions. [2019-09-08 01:11:21,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 01:11:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 299 transitions. [2019-09-08 01:11:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-08 01:11:21,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:21,099 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:21,099 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash 50764218, now seen corresponding path program 41 times [2019-09-08 01:11:21,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:21,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:21,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:22,038 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:22,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:22,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:22,050 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:22,170 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-08 01:11:22,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:22,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 01:11:22,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5781 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:22,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:22,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-08 01:11:22,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 01:11:22,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 01:11:22,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:11:22,277 INFO L87 Difference]: Start difference. First operand 218 states and 299 transitions. Second operand 44 states. [2019-09-08 01:11:22,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:22,933 INFO L93 Difference]: Finished difference Result 232 states and 317 transitions. [2019-09-08 01:11:22,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 01:11:22,933 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 297 [2019-09-08 01:11:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:22,936 INFO L225 Difference]: With dead ends: 232 [2019-09-08 01:11:22,936 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 01:11:22,937 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:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 01:11:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2019-09-08 01:11:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-08 01:11:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 306 transitions. [2019-09-08 01:11:22,945 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 306 transitions. Word has length 297 [2019-09-08 01:11:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:22,946 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 306 transitions. [2019-09-08 01:11:22,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 01:11:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 306 transitions. [2019-09-08 01:11:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 01:11:22,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:22,948 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:22,948 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:22,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:22,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1657528975, now seen corresponding path program 42 times [2019-09-08 01:11:22,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:22,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:22,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:22,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:22,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:23,825 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:23,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:23,825 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:23,835 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:23,961 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-08 01:11:23,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:23,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 01:11:23,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:24,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:24,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-08 01:11:24,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 01:11:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 01:11:24,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 01:11:24,070 INFO L87 Difference]: Start difference. First operand 223 states and 306 transitions. Second operand 45 states. [2019-09-08 01:11:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:24,585 INFO L93 Difference]: Finished difference Result 237 states and 324 transitions. [2019-09-08 01:11:24,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 01:11:24,586 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 304 [2019-09-08 01:11:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:24,588 INFO L225 Difference]: With dead ends: 237 [2019-09-08 01:11:24,588 INFO L226 Difference]: Without dead ends: 232 [2019-09-08 01:11:24,589 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:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-08 01:11:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2019-09-08 01:11:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-08 01:11:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 313 transitions. [2019-09-08 01:11:24,596 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 313 transitions. Word has length 304 [2019-09-08 01:11:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:24,596 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 313 transitions. [2019-09-08 01:11:24,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 01:11:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 313 transitions. [2019-09-08 01:11:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 01:11:24,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:24,599 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:24,599 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:24,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:24,599 INFO L82 PathProgramCache]: Analyzing trace with hash 575950298, now seen corresponding path program 43 times [2019-09-08 01:11:24,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:24,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:24,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:24,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:24,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:25,451 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:25,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:25,451 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:25,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:25,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 01:11:25,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:25,650 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:25,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:25,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-08 01:11:25,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 01:11:25,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 01:11:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:11:25,658 INFO L87 Difference]: Start difference. First operand 228 states and 313 transitions. Second operand 46 states. [2019-09-08 01:11:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:26,578 INFO L93 Difference]: Finished difference Result 242 states and 331 transitions. [2019-09-08 01:11:26,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 01:11:26,579 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 311 [2019-09-08 01:11:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:26,582 INFO L225 Difference]: With dead ends: 242 [2019-09-08 01:11:26,582 INFO L226 Difference]: Without dead ends: 237 [2019-09-08 01:11:26,583 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:26,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-08 01:11:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2019-09-08 01:11:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-08 01:11:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 320 transitions. [2019-09-08 01:11:26,601 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 320 transitions. Word has length 311 [2019-09-08 01:11:26,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:26,602 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 320 transitions. [2019-09-08 01:11:26,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 01:11:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 320 transitions. [2019-09-08 01:11:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 01:11:26,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:26,607 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:26,607 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:26,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1828291921, now seen corresponding path program 44 times [2019-09-08 01:11:26,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:26,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:26,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:26,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:26,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:27,671 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:27,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:27,672 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:27,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:27,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:27,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:27,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 01:11:27,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:27,883 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:27,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:27,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-08 01:11:27,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 01:11:27,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 01:11:27,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:11:27,890 INFO L87 Difference]: Start difference. First operand 233 states and 320 transitions. Second operand 47 states. [2019-09-08 01:11:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:28,391 INFO L93 Difference]: Finished difference Result 247 states and 338 transitions. [2019-09-08 01:11:28,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 01:11:28,392 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 318 [2019-09-08 01:11:28,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:28,393 INFO L225 Difference]: With dead ends: 247 [2019-09-08 01:11:28,393 INFO L226 Difference]: Without dead ends: 242 [2019-09-08 01:11:28,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:11:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-08 01:11:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2019-09-08 01:11:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-08 01:11:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 327 transitions. [2019-09-08 01:11:28,400 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 327 transitions. Word has length 318 [2019-09-08 01:11:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:28,401 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 327 transitions. [2019-09-08 01:11:28,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 01:11:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 327 transitions. [2019-09-08 01:11:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 01:11:28,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:28,404 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:28,404 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2030324218, now seen corresponding path program 45 times [2019-09-08 01:11:28,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:28,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:28,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:28,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:28,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:29,319 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:29,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:29,320 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:29,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:29,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-08 01:11:29,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:29,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 01:11:29,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:29,618 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:29,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:29,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-08 01:11:29,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 01:11:29,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 01:11:29,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:11:29,628 INFO L87 Difference]: Start difference. First operand 238 states and 327 transitions. Second operand 48 states. [2019-09-08 01:11:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:30,490 INFO L93 Difference]: Finished difference Result 252 states and 345 transitions. [2019-09-08 01:11:30,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 01:11:30,491 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 325 [2019-09-08 01:11:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:30,493 INFO L225 Difference]: With dead ends: 252 [2019-09-08 01:11:30,493 INFO L226 Difference]: Without dead ends: 247 [2019-09-08 01:11:30,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:11:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-08 01:11:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2019-09-08 01:11:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-08 01:11:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2019-09-08 01:11:30,502 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 325 [2019-09-08 01:11:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:30,503 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2019-09-08 01:11:30,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 01:11:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2019-09-08 01:11:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 01:11:30,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:30,507 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:30,508 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:30,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:30,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1480874703, now seen corresponding path program 46 times [2019-09-08 01:11:30,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:30,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:30,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:30,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:30,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:32,144 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:32,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:32,145 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) [2019-09-08 01:11:32,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:32,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:32,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:32,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 01:11:32,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:32,361 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:32,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:32,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-08 01:11:32,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 01:11:32,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 01:11:32,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:11:32,367 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand 49 states. [2019-09-08 01:11:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:33,000 INFO L93 Difference]: Finished difference Result 257 states and 352 transitions. [2019-09-08 01:11:33,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 01:11:33,000 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 332 [2019-09-08 01:11:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:33,003 INFO L225 Difference]: With dead ends: 257 [2019-09-08 01:11:33,003 INFO L226 Difference]: Without dead ends: 252 [2019-09-08 01:11:33,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:11:33,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-08 01:11:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2019-09-08 01:11:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-08 01:11:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 341 transitions. [2019-09-08 01:11:33,012 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 341 transitions. Word has length 332 [2019-09-08 01:11:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:33,012 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 341 transitions. [2019-09-08 01:11:33,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 01:11:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 341 transitions. [2019-09-08 01:11:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 01:11:33,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:33,015 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:33,016 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash 695766554, now seen corresponding path program 47 times [2019-09-08 01:11:33,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:33,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:33,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:33,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:33,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:34,048 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:34,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:34,049 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:34,060 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:34,204 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-08 01:11:34,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:34,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 01:11:34,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:34,343 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:34,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:34,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-08 01:11:34,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 01:11:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 01:11:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:11:34,350 INFO L87 Difference]: Start difference. First operand 248 states and 341 transitions. Second operand 50 states. [2019-09-08 01:11:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:35,250 INFO L93 Difference]: Finished difference Result 262 states and 359 transitions. [2019-09-08 01:11:35,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 01:11:35,250 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 339 [2019-09-08 01:11:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:35,252 INFO L225 Difference]: With dead ends: 262 [2019-09-08 01:11:35,252 INFO L226 Difference]: Without dead ends: 257 [2019-09-08 01:11:35,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:11:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-08 01:11:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 253. [2019-09-08 01:11:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-08 01:11:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 348 transitions. [2019-09-08 01:11:35,264 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 348 transitions. Word has length 339 [2019-09-08 01:11:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:35,265 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 348 transitions. [2019-09-08 01:11:35,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 01:11:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 348 transitions. [2019-09-08 01:11:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-08 01:11:35,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:35,267 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:35,267 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:35,268 INFO L82 PathProgramCache]: Analyzing trace with hash 416840977, now seen corresponding path program 48 times [2019-09-08 01:11:35,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:35,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:35,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:36,305 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:36,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:36,306 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:36,319 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:36,457 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-08 01:11:36,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:36,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 01:11:36,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:36,560 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:36,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:36,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-08 01:11:36,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 01:11:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 01:11:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:11:36,565 INFO L87 Difference]: Start difference. First operand 253 states and 348 transitions. Second operand 51 states. [2019-09-08 01:11:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:37,492 INFO L93 Difference]: Finished difference Result 267 states and 366 transitions. [2019-09-08 01:11:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 01:11:37,493 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 346 [2019-09-08 01:11:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:37,494 INFO L225 Difference]: With dead ends: 267 [2019-09-08 01:11:37,494 INFO L226 Difference]: Without dead ends: 262 [2019-09-08 01:11:37,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:11:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-08 01:11:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2019-09-08 01:11:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-08 01:11:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 355 transitions. [2019-09-08 01:11:37,502 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 355 transitions. Word has length 346 [2019-09-08 01:11:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:37,503 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 355 transitions. [2019-09-08 01:11:37,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 01:11:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 355 transitions. [2019-09-08 01:11:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 01:11:37,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:37,505 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:37,506 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:37,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2104288710, now seen corresponding path program 49 times [2019-09-08 01:11:37,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:37,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:37,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:37,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:37,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:38,652 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:38,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:38,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 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:38,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:38,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 01:11:38,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:38,874 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:38,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:38,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-08 01:11:38,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 01:11:38,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 01:11:38,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:11:38,879 INFO L87 Difference]: Start difference. First operand 258 states and 355 transitions. Second operand 52 states. [2019-09-08 01:11:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:39,520 INFO L93 Difference]: Finished difference Result 272 states and 373 transitions. [2019-09-08 01:11:39,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 01:11:39,520 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 353 [2019-09-08 01:11:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:39,522 INFO L225 Difference]: With dead ends: 272 [2019-09-08 01:11:39,522 INFO L226 Difference]: Without dead ends: 267 [2019-09-08 01:11:39,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:11:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-08 01:11:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2019-09-08 01:11:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-08 01:11:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 362 transitions. [2019-09-08 01:11:39,530 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 362 transitions. Word has length 353 [2019-09-08 01:11:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:39,531 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 362 transitions. [2019-09-08 01:11:39,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 01:11:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 362 transitions. [2019-09-08 01:11:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-08 01:11:39,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:39,534 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:39,534 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:39,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1328418033, now seen corresponding path program 50 times [2019-09-08 01:11:39,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:39,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:39,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:39,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:39,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:40,776 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:40,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:40,777 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:40,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:40,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:40,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:40,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 01:11:40,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:41,069 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:41,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:41,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-08 01:11:41,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 01:11:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 01:11:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:11:41,080 INFO L87 Difference]: Start difference. First operand 263 states and 362 transitions. Second operand 53 states. [2019-09-08 01:11:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:42,123 INFO L93 Difference]: Finished difference Result 277 states and 380 transitions. [2019-09-08 01:11:42,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 01:11:42,123 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 360 [2019-09-08 01:11:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:42,125 INFO L225 Difference]: With dead ends: 277 [2019-09-08 01:11:42,126 INFO L226 Difference]: Without dead ends: 272 [2019-09-08 01:11:42,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:11:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-08 01:11:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 268. [2019-09-08 01:11:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-08 01:11:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 369 transitions. [2019-09-08 01:11:42,133 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 369 transitions. Word has length 360 [2019-09-08 01:11:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:42,134 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 369 transitions. [2019-09-08 01:11:42,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 01:11:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 369 transitions. [2019-09-08 01:11:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-08 01:11:42,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:42,137 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:42,137 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:42,138 INFO L82 PathProgramCache]: Analyzing trace with hash 532016730, now seen corresponding path program 51 times [2019-09-08 01:11:42,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:42,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:42,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:42,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:42,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:43,335 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:43,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:43,335 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:43,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:43,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-08 01:11:43,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:43,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 01:11:43,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:43,586 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:43,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:43,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-08 01:11:43,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-08 01:11:43,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-08 01:11:43,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:11:43,593 INFO L87 Difference]: Start difference. First operand 268 states and 369 transitions. Second operand 54 states. [2019-09-08 01:11:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:44,623 INFO L93 Difference]: Finished difference Result 282 states and 387 transitions. [2019-09-08 01:11:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 01:11:44,623 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 367 [2019-09-08 01:11:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:44,625 INFO L225 Difference]: With dead ends: 282 [2019-09-08 01:11:44,625 INFO L226 Difference]: Without dead ends: 277 [2019-09-08 01:11:44,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:11:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-08 01:11:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2019-09-08 01:11:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-08 01:11:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 376 transitions. [2019-09-08 01:11:44,633 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 376 transitions. Word has length 367 [2019-09-08 01:11:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:44,634 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 376 transitions. [2019-09-08 01:11:44,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-08 01:11:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2019-09-08 01:11:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-08 01:11:44,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:44,637 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:44,637 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2098877649, now seen corresponding path program 52 times [2019-09-08 01:11:44,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:44,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:44,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:44,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:44,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:45,782 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:45,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:45,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:45,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:45,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:45,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 01:11:45,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:46,068 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:46,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:46,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-08 01:11:46,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-08 01:11:46,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-08 01:11:46,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:11:46,075 INFO L87 Difference]: Start difference. First operand 273 states and 376 transitions. Second operand 55 states. [2019-09-08 01:11:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:47,121 INFO L93 Difference]: Finished difference Result 287 states and 394 transitions. [2019-09-08 01:11:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 01:11:47,122 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 374 [2019-09-08 01:11:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:47,123 INFO L225 Difference]: With dead ends: 287 [2019-09-08 01:11:47,124 INFO L226 Difference]: Without dead ends: 282 [2019-09-08 01:11:47,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:11:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-08 01:11:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2019-09-08 01:11:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-08 01:11:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 383 transitions. [2019-09-08 01:11:47,131 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 383 transitions. Word has length 374 [2019-09-08 01:11:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:47,132 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 383 transitions. [2019-09-08 01:11:47,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-08 01:11:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 383 transitions. [2019-09-08 01:11:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-08 01:11:47,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:47,135 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:47,135 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:47,136 INFO L82 PathProgramCache]: Analyzing trace with hash 146999930, now seen corresponding path program 53 times [2019-09-08 01:11:47,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:47,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:47,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:47,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:47,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:48,360 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:48,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:48,360 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:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:48,519 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-08 01:11:48,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:48,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 01:11:48,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:48,617 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:48,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:48,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-09-08 01:11:48,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-08 01:11:48,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-08 01:11:48,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:11:48,624 INFO L87 Difference]: Start difference. First operand 278 states and 383 transitions. Second operand 56 states. [2019-09-08 01:11:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:49,314 INFO L93 Difference]: Finished difference Result 292 states and 401 transitions. [2019-09-08 01:11:49,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 01:11:49,316 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 381 [2019-09-08 01:11:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:49,318 INFO L225 Difference]: With dead ends: 292 [2019-09-08 01:11:49,318 INFO L226 Difference]: Without dead ends: 287 [2019-09-08 01:11:49,319 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:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-08 01:11:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2019-09-08 01:11:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-08 01:11:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 390 transitions. [2019-09-08 01:11:49,326 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 390 transitions. Word has length 381 [2019-09-08 01:11:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:49,327 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 390 transitions. [2019-09-08 01:11:49,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-08 01:11:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 390 transitions. [2019-09-08 01:11:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 01:11:49,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:49,330 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:49,330 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1484477617, now seen corresponding path program 54 times [2019-09-08 01:11:49,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:49,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:49,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:50,686 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:50,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:50,686 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:50,698 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:50,855 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-08 01:11:50,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:50,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 01:11:50,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:50,959 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:50,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:50,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-08 01:11:50,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 01:11:50,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 01:11:50,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:11:50,965 INFO L87 Difference]: Start difference. First operand 283 states and 390 transitions. Second operand 57 states. [2019-09-08 01:11:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:52,017 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2019-09-08 01:11:52,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 01:11:52,017 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 388 [2019-09-08 01:11:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:52,019 INFO L225 Difference]: With dead ends: 297 [2019-09-08 01:11:52,019 INFO L226 Difference]: Without dead ends: 292 [2019-09-08 01:11:52,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:11:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-08 01:11:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2019-09-08 01:11:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-08 01:11:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 397 transitions. [2019-09-08 01:11:52,026 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 397 transitions. Word has length 388 [2019-09-08 01:11:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:52,027 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 397 transitions. [2019-09-08 01:11:52,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 01:11:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 397 transitions. [2019-09-08 01:11:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 01:11:52,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:52,030 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:52,030 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash -769888614, now seen corresponding path program 55 times [2019-09-08 01:11:52,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:52,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:52,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:53,349 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:53,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:53,349 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:53,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:53,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 01:11:53,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:53,582 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:53,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:53,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-09-08 01:11:53,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-08 01:11:53,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-08 01:11:53,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 01:11:53,588 INFO L87 Difference]: Start difference. First operand 288 states and 397 transitions. Second operand 58 states. [2019-09-08 01:11:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:54,771 INFO L93 Difference]: Finished difference Result 302 states and 415 transitions. [2019-09-08 01:11:54,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 01:11:54,771 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 395 [2019-09-08 01:11:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:54,773 INFO L225 Difference]: With dead ends: 302 [2019-09-08 01:11:54,773 INFO L226 Difference]: Without dead ends: 297 [2019-09-08 01:11:54,774 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:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-08 01:11:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2019-09-08 01:11:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-08 01:11:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 404 transitions. [2019-09-08 01:11:54,780 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 404 transitions. Word has length 395 [2019-09-08 01:11:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:54,780 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 404 transitions. [2019-09-08 01:11:54,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-08 01:11:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 404 transitions. [2019-09-08 01:11:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-08 01:11:54,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:54,784 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:54,784 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash -89191279, now seen corresponding path program 56 times [2019-09-08 01:11:54,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:54,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:54,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:56,082 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:56,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:56,082 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:56,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:56,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:56,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:56,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 01:11:56,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:56,337 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:56,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:56,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-08 01:11:56,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 01:11:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 01:11:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 01:11:56,343 INFO L87 Difference]: Start difference. First operand 293 states and 404 transitions. Second operand 59 states. [2019-09-08 01:11:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:57,400 INFO L93 Difference]: Finished difference Result 307 states and 422 transitions. [2019-09-08 01:11:57,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 01:11:57,401 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 402 [2019-09-08 01:11:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:57,403 INFO L225 Difference]: With dead ends: 307 [2019-09-08 01:11:57,404 INFO L226 Difference]: Without dead ends: 302 [2019-09-08 01:11:57,404 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:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-08 01:11:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-09-08 01:11:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-08 01:11:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 411 transitions. [2019-09-08 01:11:57,411 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 411 transitions. Word has length 402 [2019-09-08 01:11:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:57,411 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 411 transitions. [2019-09-08 01:11:57,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 01:11:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 411 transitions. [2019-09-08 01:11:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 01:11:57,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:57,414 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:57,415 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:57,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1130095942, now seen corresponding path program 57 times [2019-09-08 01:11:57,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:57,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:57,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:58,778 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:58,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:58,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:58,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:58,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-08 01:11:58,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:58,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 01:11:58,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:59,057 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:59,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:59,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-09-08 01:11:59,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-08 01:11:59,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-08 01:11:59,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:11:59,063 INFO L87 Difference]: Start difference. First operand 298 states and 411 transitions. Second operand 60 states. [2019-09-08 01:12:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:00,418 INFO L93 Difference]: Finished difference Result 312 states and 429 transitions. [2019-09-08 01:12:00,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 01:12:00,418 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 409 [2019-09-08 01:12:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:00,422 INFO L225 Difference]: With dead ends: 312 [2019-09-08 01:12:00,422 INFO L226 Difference]: Without dead ends: 307 [2019-09-08 01:12:00,425 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:12:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-08 01:12:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2019-09-08 01:12:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 01:12:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 418 transitions. [2019-09-08 01:12:00,436 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 418 transitions. Word has length 409 [2019-09-08 01:12:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:00,437 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 418 transitions. [2019-09-08 01:12:00,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-08 01:12:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 418 transitions. [2019-09-08 01:12:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 01:12:00,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:00,443 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:12:00,443 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:00,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1064076175, now seen corresponding path program 58 times [2019-09-08 01:12:00,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:00,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:00,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:00,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:03,248 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:12:03,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:03,249 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:12:03,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:12:03,449 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:12:03,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:03,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 01:12:03,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:03,687 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:12:03,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:03,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-08 01:12:03,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-08 01:12:03,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-08 01:12:03,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:12:03,695 INFO L87 Difference]: Start difference. First operand 303 states and 418 transitions. Second operand 61 states. [2019-09-08 01:12:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:04,696 INFO L93 Difference]: Finished difference Result 317 states and 436 transitions. [2019-09-08 01:12:04,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 01:12:04,696 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 416 [2019-09-08 01:12:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:04,698 INFO L225 Difference]: With dead ends: 317 [2019-09-08 01:12:04,698 INFO L226 Difference]: Without dead ends: 312 [2019-09-08 01:12:04,699 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:12:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-08 01:12:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2019-09-08 01:12:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-08 01:12:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 425 transitions. [2019-09-08 01:12:04,705 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 425 transitions. Word has length 416 [2019-09-08 01:12:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:04,705 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 425 transitions. [2019-09-08 01:12:04,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-08 01:12:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 425 transitions. [2019-09-08 01:12:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-09-08 01:12:04,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:04,709 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:12:04,709 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:04,709 INFO L82 PathProgramCache]: Analyzing trace with hash -709095718, now seen corresponding path program 59 times [2019-09-08 01:12:04,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:04,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:04,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:04,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:04,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:06,263 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:12:06,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:06,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 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:12:06,275 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:12:06,455 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-08 01:12:06,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:06,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 01:12:06,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:06,610 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:12:06,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:06,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-09-08 01:12:06,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-08 01:12:06,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-08 01:12:06,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 01:12:06,617 INFO L87 Difference]: Start difference. First operand 308 states and 425 transitions. Second operand 62 states. [2019-09-08 01:12:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:07,470 INFO L93 Difference]: Finished difference Result 322 states and 443 transitions. [2019-09-08 01:12:07,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-08 01:12:07,470 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 423 [2019-09-08 01:12:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:07,472 INFO L225 Difference]: With dead ends: 322 [2019-09-08 01:12:07,472 INFO L226 Difference]: Without dead ends: 317 [2019-09-08 01:12:07,472 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:12:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-08 01:12:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2019-09-08 01:12:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-08 01:12:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 432 transitions. [2019-09-08 01:12:07,479 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 432 transitions. Word has length 423 [2019-09-08 01:12:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:07,480 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 432 transitions. [2019-09-08 01:12:07,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-08 01:12:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 432 transitions. [2019-09-08 01:12:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-09-08 01:12:07,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:07,483 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:12:07,483 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:07,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:07,484 INFO L82 PathProgramCache]: Analyzing trace with hash 713466961, now seen corresponding path program 60 times [2019-09-08 01:12:07,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:07,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:07,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:07,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:07,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:09,095 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:12:09,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:09,096 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:12:09,107 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:09,312 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-08 01:12:09,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:09,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 01:12:09,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:09,428 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:12:09,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:09,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-08 01:12:09,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-08 01:12:09,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-08 01:12:09,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:12:09,434 INFO L87 Difference]: Start difference. First operand 313 states and 432 transitions. Second operand 63 states. [2019-09-08 01:12:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:10,325 INFO L93 Difference]: Finished difference Result 327 states and 450 transitions. [2019-09-08 01:12:10,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 01:12:10,326 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 430 [2019-09-08 01:12:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:10,328 INFO L225 Difference]: With dead ends: 327 [2019-09-08 01:12:10,328 INFO L226 Difference]: Without dead ends: 322 [2019-09-08 01:12:10,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:12:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-08 01:12:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2019-09-08 01:12:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-08 01:12:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 439 transitions. [2019-09-08 01:12:10,336 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 439 transitions. Word has length 430 [2019-09-08 01:12:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:10,337 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 439 transitions. [2019-09-08 01:12:10,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-08 01:12:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 439 transitions. [2019-09-08 01:12:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-08 01:12:10,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:10,340 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:12:10,340 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash 390482682, now seen corresponding path program 61 times [2019-09-08 01:12:10,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:10,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:10,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:11,901 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:11,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:11,902 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:11,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:12,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 01:12:12,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:12,159 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:12,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:12,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-09-08 01:12:12,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-08 01:12:12,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-08 01:12:12,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:12:12,165 INFO L87 Difference]: Start difference. First operand 318 states and 439 transitions. Second operand 64 states. [2019-09-08 01:12:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:13,057 INFO L93 Difference]: Finished difference Result 332 states and 457 transitions. [2019-09-08 01:12:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 01:12:13,057 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 437 [2019-09-08 01:12:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:13,059 INFO L225 Difference]: With dead ends: 332 [2019-09-08 01:12:13,059 INFO L226 Difference]: Without dead ends: 327 [2019-09-08 01:12:13,060 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:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-08 01:12:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2019-09-08 01:12:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-08 01:12:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 446 transitions. [2019-09-08 01:12:13,067 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 446 transitions. Word has length 437 [2019-09-08 01:12:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:13,068 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 446 transitions. [2019-09-08 01:12:13,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-08 01:12:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 446 transitions. [2019-09-08 01:12:13,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-08 01:12:13,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:13,071 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:13,071 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:13,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1134132175, now seen corresponding path program 62 times [2019-09-08 01:12:13,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:13,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:13,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:13,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:13,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:14,718 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:14,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:14,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:12:14,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:12:14,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:14,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 01:12:14,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:14,975 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:14,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:14,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-08 01:12:14,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-08 01:12:14,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-08 01:12:14,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:12:14,982 INFO L87 Difference]: Start difference. First operand 323 states and 446 transitions. Second operand 65 states. [2019-09-08 01:12:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:15,715 INFO L93 Difference]: Finished difference Result 337 states and 464 transitions. [2019-09-08 01:12:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 01:12:15,715 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 444 [2019-09-08 01:12:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:15,717 INFO L225 Difference]: With dead ends: 337 [2019-09-08 01:12:15,717 INFO L226 Difference]: Without dead ends: 332 [2019-09-08 01:12:15,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:12:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-08 01:12:15,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-09-08 01:12:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-08 01:12:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 453 transitions. [2019-09-08 01:12:15,725 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 453 transitions. Word has length 444 [2019-09-08 01:12:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:15,726 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 453 transitions. [2019-09-08 01:12:15,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-08 01:12:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 453 transitions. [2019-09-08 01:12:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-09-08 01:12:15,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:15,729 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:15,729 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:15,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2019242214, now seen corresponding path program 63 times [2019-09-08 01:12:15,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:15,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:15,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:15,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:15,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:17,345 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:17,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:17,346 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:17,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:12:17,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-08 01:12:17,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:17,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 01:12:17,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:17,692 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:17,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:17,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-09-08 01:12:17,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-08 01:12:17,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-08 01:12:17,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 01:12:17,699 INFO L87 Difference]: Start difference. First operand 328 states and 453 transitions. Second operand 66 states. [2019-09-08 01:12:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:18,641 INFO L93 Difference]: Finished difference Result 342 states and 471 transitions. [2019-09-08 01:12:18,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 01:12:18,641 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 451 [2019-09-08 01:12:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:18,644 INFO L225 Difference]: With dead ends: 342 [2019-09-08 01:12:18,644 INFO L226 Difference]: Without dead ends: 337 [2019-09-08 01:12:18,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 01:12:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-08 01:12:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2019-09-08 01:12:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 01:12:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 460 transitions. [2019-09-08 01:12:18,651 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 460 transitions. Word has length 451 [2019-09-08 01:12:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:18,652 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 460 transitions. [2019-09-08 01:12:18,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-08 01:12:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 460 transitions. [2019-09-08 01:12:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2019-09-08 01:12:18,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:18,655 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:18,656 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash -577692655, now seen corresponding path program 64 times [2019-09-08 01:12:18,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:18,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:18,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:20,703 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:20,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:20,703 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:20,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:12:20,850 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:12:20,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:20,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-08 01:12:20,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:21,051 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:21,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:21,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-08 01:12:21,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-08 01:12:21,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-08 01:12:21,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:12:21,059 INFO L87 Difference]: Start difference. First operand 333 states and 460 transitions. Second operand 67 states. [2019-09-08 01:12:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:21,825 INFO L93 Difference]: Finished difference Result 347 states and 478 transitions. [2019-09-08 01:12:21,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 01:12:21,825 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 458 [2019-09-08 01:12:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:21,828 INFO L225 Difference]: With dead ends: 347 [2019-09-08 01:12:21,828 INFO L226 Difference]: Without dead ends: 342 [2019-09-08 01:12:21,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:12:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-08 01:12:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2019-09-08 01:12:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-08 01:12:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 467 transitions. [2019-09-08 01:12:21,835 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 467 transitions. Word has length 458 [2019-09-08 01:12:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:21,836 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 467 transitions. [2019-09-08 01:12:21,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-08 01:12:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 467 transitions. [2019-09-08 01:12:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-09-08 01:12:21,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:21,838 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:21,839 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:21,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:21,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1505336122, now seen corresponding path program 65 times [2019-09-08 01:12:21,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:21,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:21,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:21,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:21,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:23,647 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:23,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:23,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 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:23,659 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:12:23,856 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-09-08 01:12:23,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:23,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 01:12:23,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:23,986 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:23,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:23,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-09-08 01:12:23,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-08 01:12:23,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-08 01:12:23,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:12:23,992 INFO L87 Difference]: Start difference. First operand 338 states and 467 transitions. Second operand 68 states. [2019-09-08 01:12:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:25,035 INFO L93 Difference]: Finished difference Result 352 states and 485 transitions. [2019-09-08 01:12:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 01:12:25,035 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 465 [2019-09-08 01:12:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:25,037 INFO L225 Difference]: With dead ends: 352 [2019-09-08 01:12:25,037 INFO L226 Difference]: Without dead ends: 347 [2019-09-08 01:12:25,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:12:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-08 01:12:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2019-09-08 01:12:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-08 01:12:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 474 transitions. [2019-09-08 01:12:25,043 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 474 transitions. Word has length 465 [2019-09-08 01:12:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:25,043 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 474 transitions. [2019-09-08 01:12:25,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-08 01:12:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 474 transitions. [2019-09-08 01:12:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-09-08 01:12:25,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:25,046 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:25,046 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:25,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:25,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1192989711, now seen corresponding path program 66 times [2019-09-08 01:12:25,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:25,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:25,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:27,020 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:27,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:27,020 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:27,031 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:27,237 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-08 01:12:27,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:27,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-08 01:12:27,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:27,409 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:27,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:27,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-08 01:12:27,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-08 01:12:27,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-08 01:12:27,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:12:27,416 INFO L87 Difference]: Start difference. First operand 343 states and 474 transitions. Second operand 69 states. [2019-09-08 01:12:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:28,516 INFO L93 Difference]: Finished difference Result 357 states and 492 transitions. [2019-09-08 01:12:28,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 01:12:28,517 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 472 [2019-09-08 01:12:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:28,519 INFO L225 Difference]: With dead ends: 357 [2019-09-08 01:12:28,519 INFO L226 Difference]: Without dead ends: 352 [2019-09-08 01:12:28,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:12:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-08 01:12:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-09-08 01:12:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-08 01:12:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 481 transitions. [2019-09-08 01:12:28,525 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 481 transitions. Word has length 472 [2019-09-08 01:12:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:28,525 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 481 transitions. [2019-09-08 01:12:28,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-08 01:12:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 481 transitions. [2019-09-08 01:12:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-08 01:12:28,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:28,528 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:28,528 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:28,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:28,529 INFO L82 PathProgramCache]: Analyzing trace with hash 216444762, now seen corresponding path program 67 times [2019-09-08 01:12:28,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:28,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:28,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:30,407 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:30,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:30,408 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:30,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:30,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-08 01:12:30,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:30,812 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:30,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:30,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-09-08 01:12:30,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-08 01:12:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-08 01:12:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:12:30,820 INFO L87 Difference]: Start difference. First operand 348 states and 481 transitions. Second operand 70 states. [2019-09-08 01:12:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:31,517 INFO L93 Difference]: Finished difference Result 362 states and 499 transitions. [2019-09-08 01:12:31,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 01:12:31,517 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 479 [2019-09-08 01:12:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:31,519 INFO L225 Difference]: With dead ends: 362 [2019-09-08 01:12:31,519 INFO L226 Difference]: Without dead ends: 357 [2019-09-08 01:12:31,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:12:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-09-08 01:12:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2019-09-08 01:12:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-08 01:12:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 488 transitions. [2019-09-08 01:12:31,526 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 488 transitions. Word has length 479 [2019-09-08 01:12:31,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:31,527 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 488 transitions. [2019-09-08 01:12:31,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-08 01:12:31,527 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 488 transitions. [2019-09-08 01:12:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-09-08 01:12:31,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:31,531 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:31,531 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:31,531 INFO L82 PathProgramCache]: Analyzing trace with hash 482243537, now seen corresponding path program 68 times [2019-09-08 01:12:31,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:31,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:31,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:31,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:31,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:33,373 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:33,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:33,373 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:33,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:12:33,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:12:33,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:33,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 01:12:33,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:33,666 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:33,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:33,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-08 01:12:33,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-08 01:12:33,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-08 01:12:33,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 01:12:33,673 INFO L87 Difference]: Start difference. First operand 353 states and 488 transitions. Second operand 71 states. [2019-09-08 01:12:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:34,803 INFO L93 Difference]: Finished difference Result 367 states and 506 transitions. [2019-09-08 01:12:34,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-08 01:12:34,803 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 486 [2019-09-08 01:12:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:34,805 INFO L225 Difference]: With dead ends: 367 [2019-09-08 01:12:34,805 INFO L226 Difference]: Without dead ends: 362 [2019-09-08 01:12:34,806 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:34,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-08 01:12:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2019-09-08 01:12:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-09-08 01:12:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 495 transitions. [2019-09-08 01:12:34,812 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 495 transitions. Word has length 486 [2019-09-08 01:12:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:34,812 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 495 transitions. [2019-09-08 01:12:34,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-08 01:12:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 495 transitions. [2019-09-08 01:12:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-08 01:12:34,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:34,815 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:34,815 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:34,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:34,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1928459398, now seen corresponding path program 69 times [2019-09-08 01:12:34,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:34,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:34,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:34,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:34,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:36,724 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:36,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:36,724 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:36,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:12:36,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-08 01:12:36,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:36,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 01:12:36,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:37,192 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:37,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:37,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-09-08 01:12:37,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-08 01:12:37,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-08 01:12:37,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:12:37,199 INFO L87 Difference]: Start difference. First operand 358 states and 495 transitions. Second operand 72 states. [2019-09-08 01:12:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:38,344 INFO L93 Difference]: Finished difference Result 372 states and 513 transitions. [2019-09-08 01:12:38,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-08 01:12:38,344 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 493 [2019-09-08 01:12:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:38,348 INFO L225 Difference]: With dead ends: 372 [2019-09-08 01:12:38,348 INFO L226 Difference]: Without dead ends: 367 [2019-09-08 01:12:38,349 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:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-09-08 01:12:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2019-09-08 01:12:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-08 01:12:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 502 transitions. [2019-09-08 01:12:38,357 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 502 transitions. Word has length 493 [2019-09-08 01:12:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:38,358 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 502 transitions. [2019-09-08 01:12:38,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-08 01:12:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 502 transitions. [2019-09-08 01:12:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-08 01:12:38,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:38,362 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:38,362 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:38,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:38,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1526543281, now seen corresponding path program 70 times [2019-09-08 01:12:38,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:38,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:38,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:38,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:38,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:40,363 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:40,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:40,364 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:40,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:12:40,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:12:40,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:40,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-08 01:12:40,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:40,666 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:40,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:40,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-08 01:12:40,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-08 01:12:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-08 01:12:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:12:40,672 INFO L87 Difference]: Start difference. First operand 363 states and 502 transitions. Second operand 73 states. [2019-09-08 01:12:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:41,762 INFO L93 Difference]: Finished difference Result 377 states and 520 transitions. [2019-09-08 01:12:41,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 01:12:41,762 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 500 [2019-09-08 01:12:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:41,765 INFO L225 Difference]: With dead ends: 377 [2019-09-08 01:12:41,765 INFO L226 Difference]: Without dead ends: 372 [2019-09-08 01:12:41,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:12:41,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-08 01:12:41,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2019-09-08 01:12:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-08 01:12:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 509 transitions. [2019-09-08 01:12:41,773 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 509 transitions. Word has length 500 [2019-09-08 01:12:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:41,774 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 509 transitions. [2019-09-08 01:12:41,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-08 01:12:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 509 transitions. [2019-09-08 01:12:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-08 01:12:41,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:41,778 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:41,778 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:41,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:41,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1385279386, now seen corresponding path program 71 times [2019-09-08 01:12:41,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:41,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:41,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:43,839 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:43,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:43,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:43,849 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:12:44,073 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-09-08 01:12:44,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:44,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-08 01:12:44,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:44,225 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:44,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:44,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-09-08 01:12:44,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-08 01:12:44,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-08 01:12:44,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:12:44,232 INFO L87 Difference]: Start difference. First operand 368 states and 509 transitions. Second operand 74 states. [2019-09-08 01:12:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:45,184 INFO L93 Difference]: Finished difference Result 382 states and 527 transitions. [2019-09-08 01:12:45,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-08 01:12:45,184 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 507 [2019-09-08 01:12:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:45,187 INFO L225 Difference]: With dead ends: 382 [2019-09-08 01:12:45,187 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 01:12:45,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:12:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 01:12:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 373. [2019-09-08 01:12:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-08 01:12:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 516 transitions. [2019-09-08 01:12:45,196 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 516 transitions. Word has length 507 [2019-09-08 01:12:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:45,197 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 516 transitions. [2019-09-08 01:12:45,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-08 01:12:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 516 transitions. [2019-09-08 01:12:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-09-08 01:12:45,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:45,201 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:45,202 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash 687778705, now seen corresponding path program 72 times [2019-09-08 01:12:45,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:45,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:45,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:45,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:47,316 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:47,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:47,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:47,326 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:47,626 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-08 01:12:47,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:47,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-08 01:12:47,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:47,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:47,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:47,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-08 01:12:47,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-08 01:12:47,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-08 01:12:47,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:12:47,850 INFO L87 Difference]: Start difference. First operand 373 states and 516 transitions. Second operand 75 states. [2019-09-08 01:12:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:48,736 INFO L93 Difference]: Finished difference Result 387 states and 534 transitions. [2019-09-08 01:12:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 01:12:48,737 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 514 [2019-09-08 01:12:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:48,741 INFO L225 Difference]: With dead ends: 387 [2019-09-08 01:12:48,741 INFO L226 Difference]: Without dead ends: 382 [2019-09-08 01:12:48,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:12:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-08 01:12:48,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2019-09-08 01:12:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-09-08 01:12:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 523 transitions. [2019-09-08 01:12:48,748 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 523 transitions. Word has length 514 [2019-09-08 01:12:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:48,749 INFO L475 AbstractCegarLoop]: Abstraction has 378 states and 523 transitions. [2019-09-08 01:12:48,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-08 01:12:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 523 transitions. [2019-09-08 01:12:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2019-09-08 01:12:48,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:48,752 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:48,752 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:48,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2108449862, now seen corresponding path program 73 times [2019-09-08 01:12:48,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:48,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:48,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:48,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:48,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:50,900 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:50,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:50,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:51,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-08 01:12:51,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:51,232 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:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-09-08 01:12:51,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-08 01:12:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-08 01:12:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 01:12:51,239 INFO L87 Difference]: Start difference. First operand 378 states and 523 transitions. Second operand 76 states. [2019-09-08 01:12:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:52,118 INFO L93 Difference]: Finished difference Result 392 states and 541 transitions. [2019-09-08 01:12:52,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-08 01:12:52,119 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 521 [2019-09-08 01:12:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:52,123 INFO L225 Difference]: With dead ends: 392 [2019-09-08 01:12:52,123 INFO L226 Difference]: Without dead ends: 387 [2019-09-08 01:12:52,124 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:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-08 01:12:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-08 01:12:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-08 01:12:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 530 transitions. [2019-09-08 01:12:52,130 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 530 transitions. Word has length 521 [2019-09-08 01:12:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:52,130 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 530 transitions. [2019-09-08 01:12:52,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-08 01:12:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 530 transitions. [2019-09-08 01:12:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-09-08 01:12:52,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:52,133 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:52,134 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2141248369, now seen corresponding path program 74 times [2019-09-08 01:12:52,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:52,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:52,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:54,371 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:54,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:54,372 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:54,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:12:54,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:12:54,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:54,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 01:12:54,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:54,797 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:54,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:54,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-08 01:12:54,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-08 01:12:54,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-08 01:12:54,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:12:54,804 INFO L87 Difference]: Start difference. First operand 383 states and 530 transitions. Second operand 77 states. [2019-09-08 01:12:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:55,899 INFO L93 Difference]: Finished difference Result 397 states and 548 transitions. [2019-09-08 01:12:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 01:12:55,899 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 528 [2019-09-08 01:12:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:55,901 INFO L225 Difference]: With dead ends: 397 [2019-09-08 01:12:55,901 INFO L226 Difference]: Without dead ends: 392 [2019-09-08 01:12:55,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:12:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-08 01:12:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-09-08 01:12:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-08 01:12:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 537 transitions. [2019-09-08 01:12:55,908 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 537 transitions. Word has length 528 [2019-09-08 01:12:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:55,909 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 537 transitions. [2019-09-08 01:12:55,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-08 01:12:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 537 transitions. [2019-09-08 01:12:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-09-08 01:12:55,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:55,912 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:55,912 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash 230019034, now seen corresponding path program 75 times [2019-09-08 01:12:55,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:55,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:55,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:55,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:55,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:58,215 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:58,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:58,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 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:58,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:12:58,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-09-08 01:12:58,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:58,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-08 01:12:58,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:58,634 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:58,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:58,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-09-08 01:12:58,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-08 01:12:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-08 01:12:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:12:58,641 INFO L87 Difference]: Start difference. First operand 388 states and 537 transitions. Second operand 78 states. [2019-09-08 01:12:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:59,681 INFO L93 Difference]: Finished difference Result 402 states and 555 transitions. [2019-09-08 01:12:59,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-08 01:12:59,681 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 535 [2019-09-08 01:12:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:59,683 INFO L225 Difference]: With dead ends: 402 [2019-09-08 01:12:59,683 INFO L226 Difference]: Without dead ends: 397 [2019-09-08 01:12:59,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:12:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-09-08 01:12:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 393. [2019-09-08 01:12:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-09-08 01:12:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 544 transitions. [2019-09-08 01:12:59,690 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 544 transitions. Word has length 535 [2019-09-08 01:12:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:59,691 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 544 transitions. [2019-09-08 01:12:59,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-08 01:12:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 544 transitions. [2019-09-08 01:12:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-09-08 01:12:59,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:59,695 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:59,695 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:59,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2067907409, now seen corresponding path program 76 times [2019-09-08 01:12:59,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:59,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:59,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:02,124 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:13:02,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:02,125 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:13:02,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:13:02,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:13:02,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:02,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-08 01:13:02,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:02,465 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:13:02,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:02,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-08 01:13:02,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-08 01:13:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-08 01:13:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:13:02,472 INFO L87 Difference]: Start difference. First operand 393 states and 544 transitions. Second operand 79 states. [2019-09-08 01:13:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:03,918 INFO L93 Difference]: Finished difference Result 407 states and 562 transitions. [2019-09-08 01:13:03,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 01:13:03,918 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 542 [2019-09-08 01:13:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:03,920 INFO L225 Difference]: With dead ends: 407 [2019-09-08 01:13:03,920 INFO L226 Difference]: Without dead ends: 402 [2019-09-08 01:13:03,921 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:13:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-08 01:13:03,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2019-09-08 01:13:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-08 01:13:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 551 transitions. [2019-09-08 01:13:03,927 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 551 transitions. Word has length 542 [2019-09-08 01:13:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:03,927 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 551 transitions. [2019-09-08 01:13:03,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-08 01:13:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 551 transitions. [2019-09-08 01:13:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-09-08 01:13:03,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:03,931 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:13:03,931 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:03,931 INFO L82 PathProgramCache]: Analyzing trace with hash -761639942, now seen corresponding path program 77 times [2019-09-08 01:13:03,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:03,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:03,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:03,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:03,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:06,351 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:13:06,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13: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 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:13:06,364 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:13:06,614 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-09-08 01:13:06,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:06,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-08 01:13:06,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:06,811 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:13:06,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:06,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-09-08 01:13:06,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-08 01:13:06,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-08 01:13:06,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:13:06,818 INFO L87 Difference]: Start difference. First operand 398 states and 551 transitions. Second operand 80 states. [2019-09-08 01:13:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:08,014 INFO L93 Difference]: Finished difference Result 412 states and 569 transitions. [2019-09-08 01:13:08,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-08 01:13:08,015 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 549 [2019-09-08 01:13:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:08,019 INFO L225 Difference]: With dead ends: 412 [2019-09-08 01:13:08,019 INFO L226 Difference]: Without dead ends: 407 [2019-09-08 01:13:08,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:13:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-08 01:13:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 403. [2019-09-08 01:13:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-08 01:13:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 558 transitions. [2019-09-08 01:13:08,028 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 558 transitions. Word has length 549 [2019-09-08 01:13:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:08,029 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 558 transitions. [2019-09-08 01:13:08,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-08 01:13:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 558 transitions. [2019-09-08 01:13:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-08 01:13:08,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:08,033 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:13:08,033 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1002398513, now seen corresponding path program 78 times [2019-09-08 01:13:08,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:08,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:08,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:08,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:10,402 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:13:10,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:10,403 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:13:10,413 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:13:10,682 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-08 01:13:10,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:10,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 01:13:10,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:10,855 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:13:10,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:10,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-08 01:13:10,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-08 01:13:10,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-08 01:13:10,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 01:13:10,863 INFO L87 Difference]: Start difference. First operand 403 states and 558 transitions. Second operand 81 states. [2019-09-08 01:13:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:12,066 INFO L93 Difference]: Finished difference Result 417 states and 576 transitions. [2019-09-08 01:13:12,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 01:13:12,067 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 556 [2019-09-08 01:13:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:12,069 INFO L225 Difference]: With dead ends: 417 [2019-09-08 01:13:12,069 INFO L226 Difference]: Without dead ends: 412 [2019-09-08 01:13:12,069 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:13:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-09-08 01:13:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 408. [2019-09-08 01:13:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-08 01:13:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 565 transitions. [2019-09-08 01:13:12,077 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 565 transitions. Word has length 556 [2019-09-08 01:13:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:12,078 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 565 transitions. [2019-09-08 01:13:12,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-08 01:13:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 565 transitions. [2019-09-08 01:13:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-09-08 01:13:12,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:12,081 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:13:12,081 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:12,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1151135718, now seen corresponding path program 79 times [2019-09-08 01:13:12,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:12,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:12,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:12,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:12,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:14,521 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:14,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13: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 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:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:14,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-08 01:13:14,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:14,890 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:14,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:14,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-09-08 01:13:14,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-08 01:13:14,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-08 01:13:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:13:14,895 INFO L87 Difference]: Start difference. First operand 408 states and 565 transitions. Second operand 82 states. [2019-09-08 01:13:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:15,863 INFO L93 Difference]: Finished difference Result 422 states and 583 transitions. [2019-09-08 01:13:15,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-08 01:13:15,864 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 563 [2019-09-08 01:13:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:15,866 INFO L225 Difference]: With dead ends: 422 [2019-09-08 01:13:15,866 INFO L226 Difference]: Without dead ends: 417 [2019-09-08 01:13:15,867 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:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-08 01:13:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 413. [2019-09-08 01:13:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-09-08 01:13:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 572 transitions. [2019-09-08 01:13:15,873 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 572 transitions. Word has length 563 [2019-09-08 01:13:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:15,874 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 572 transitions. [2019-09-08 01:13:15,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-08 01:13:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 572 transitions. [2019-09-08 01:13:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-09-08 01:13:15,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:15,877 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:15,877 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:15,878 INFO L82 PathProgramCache]: Analyzing trace with hash -998786287, now seen corresponding path program 80 times [2019-09-08 01:13:15,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:15,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:15,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:15,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:15,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:18,374 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:18,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:18,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 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:18,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:13:18,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:13:18,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:18,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-08 01:13:18,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:18,722 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:18,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:18,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-08 01:13:18,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-08 01:13:18,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-08 01:13:18,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:13:18,728 INFO L87 Difference]: Start difference. First operand 413 states and 572 transitions. Second operand 83 states. [2019-09-08 01:13:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:19,703 INFO L93 Difference]: Finished difference Result 427 states and 590 transitions. [2019-09-08 01:13:19,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-08 01:13:19,703 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 570 [2019-09-08 01:13:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:19,707 INFO L225 Difference]: With dead ends: 427 [2019-09-08 01:13:19,707 INFO L226 Difference]: Without dead ends: 422 [2019-09-08 01:13:19,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:13:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-08 01:13:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 418. [2019-09-08 01:13:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-08 01:13:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 579 transitions. [2019-09-08 01:13:19,714 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 579 transitions. Word has length 570 [2019-09-08 01:13:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:19,714 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 579 transitions. [2019-09-08 01:13:19,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-08 01:13:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 579 transitions. [2019-09-08 01:13:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-09-08 01:13:19,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:19,717 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:19,718 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:19,718 INFO L82 PathProgramCache]: Analyzing trace with hash -554558406, now seen corresponding path program 81 times [2019-09-08 01:13:19,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:19,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:19,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:19,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:19,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:22,208 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:22,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:22,208 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:22,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:13:22,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-09-08 01:13:22,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:22,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-08 01:13:22,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:22,678 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:22,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:22,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-09-08 01:13:22,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-08 01:13:22,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-08 01:13:22,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:13:22,685 INFO L87 Difference]: Start difference. First operand 418 states and 579 transitions. Second operand 84 states. [2019-09-08 01:13:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:23,881 INFO L93 Difference]: Finished difference Result 432 states and 597 transitions. [2019-09-08 01:13:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 01:13:23,882 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 577 [2019-09-08 01:13:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:23,884 INFO L225 Difference]: With dead ends: 432 [2019-09-08 01:13:23,884 INFO L226 Difference]: Without dead ends: 427 [2019-09-08 01:13:23,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:13:23,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-08 01:13:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-09-08 01:13:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-08 01:13:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 586 transitions. [2019-09-08 01:13:23,891 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 586 transitions. Word has length 577 [2019-09-08 01:13:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:23,891 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 586 transitions. [2019-09-08 01:13:23,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-08 01:13:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 586 transitions. [2019-09-08 01:13:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-09-08 01:13:23,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:23,894 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:23,895 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:23,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:23,895 INFO L82 PathProgramCache]: Analyzing trace with hash -599209231, now seen corresponding path program 82 times [2019-09-08 01:13:23,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:23,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:23,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:23,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:23,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:26,485 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:26,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:26,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 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:26,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:13:26,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:13:26,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:26,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-08 01:13:26,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:26,927 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:26,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:26,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-08 01:13:26,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-08 01:13:26,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-08 01:13:26,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:13:26,933 INFO L87 Difference]: Start difference. First operand 423 states and 586 transitions. Second operand 85 states. [2019-09-08 01:13:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:28,271 INFO L93 Difference]: Finished difference Result 437 states and 604 transitions. [2019-09-08 01:13:28,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-08 01:13:28,271 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 584 [2019-09-08 01:13:28,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:28,273 INFO L225 Difference]: With dead ends: 437 [2019-09-08 01:13:28,274 INFO L226 Difference]: Without dead ends: 432 [2019-09-08 01:13:28,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:13:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-08 01:13:28,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 428. [2019-09-08 01:13:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-08 01:13:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 593 transitions. [2019-09-08 01:13:28,281 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 593 transitions. Word has length 584 [2019-09-08 01:13:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:28,281 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 593 transitions. [2019-09-08 01:13:28,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-08 01:13:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 593 transitions. [2019-09-08 01:13:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-09-08 01:13:28,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:28,285 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:28,285 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:28,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1599508390, now seen corresponding path program 83 times [2019-09-08 01:13:28,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:28,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:28,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:28,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:28,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:31,016 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:31,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:31,017 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:31,027 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:13:31,312 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-09-08 01:13:31,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:31,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-08 01:13:31,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:31,511 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:31,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:31,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-09-08 01:13:31,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-08 01:13:31,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-08 01:13:31,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:13:31,518 INFO L87 Difference]: Start difference. First operand 428 states and 593 transitions. Second operand 86 states. [2019-09-08 01:13:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:33,154 INFO L93 Difference]: Finished difference Result 442 states and 611 transitions. [2019-09-08 01:13:33,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-08 01:13:33,155 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 591 [2019-09-08 01:13:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:33,157 INFO L225 Difference]: With dead ends: 442 [2019-09-08 01:13:33,157 INFO L226 Difference]: Without dead ends: 437 [2019-09-08 01:13:33,158 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:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-08 01:13:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-09-08 01:13:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-09-08 01:13:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 600 transitions. [2019-09-08 01:13:33,165 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 600 transitions. Word has length 591 [2019-09-08 01:13:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:33,166 INFO L475 AbstractCegarLoop]: Abstraction has 433 states and 600 transitions. [2019-09-08 01:13:33,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-08 01:13:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 600 transitions. [2019-09-08 01:13:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-09-08 01:13:33,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:33,169 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:33,169 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:33,170 INFO L82 PathProgramCache]: Analyzing trace with hash -309292335, now seen corresponding path program 84 times [2019-09-08 01:13:33,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:33,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:33,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:33,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:33,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:35,881 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:35,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:35,881 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:35,891 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:13:36,171 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-09-08 01:13:36,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:36,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 01:13:36,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:36,386 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:36,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:36,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-08 01:13:36,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-08 01:13:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-08 01:13:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 01:13:36,394 INFO L87 Difference]: Start difference. First operand 433 states and 600 transitions. Second operand 87 states. [2019-09-08 01:13:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:37,927 INFO L93 Difference]: Finished difference Result 447 states and 618 transitions. [2019-09-08 01:13:37,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 01:13:37,928 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 598 [2019-09-08 01:13:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:37,930 INFO L225 Difference]: With dead ends: 447 [2019-09-08 01:13:37,930 INFO L226 Difference]: Without dead ends: 442 [2019-09-08 01:13:37,931 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:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-08 01:13:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 438. [2019-09-08 01:13:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-09-08 01:13:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 607 transitions. [2019-09-08 01:13:37,938 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 607 transitions. Word has length 598 [2019-09-08 01:13:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:37,939 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 607 transitions. [2019-09-08 01:13:37,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-08 01:13:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 607 transitions. [2019-09-08 01:13:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-09-08 01:13:37,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:37,943 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:37,943 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash -798290822, now seen corresponding path program 85 times [2019-09-08 01:13:37,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:37,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:37,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:40,719 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:40,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:40,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 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:40,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:40,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-08 01:13:40,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:41,098 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: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 [88, 88] total 88 [2019-09-08 01:13:41,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-08 01:13:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-08 01:13:41,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:13:41,105 INFO L87 Difference]: Start difference. First operand 438 states and 607 transitions. Second operand 88 states. [2019-09-08 01:13:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:42,176 INFO L93 Difference]: Finished difference Result 452 states and 625 transitions. [2019-09-08 01:13:42,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-08 01:13:42,176 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 605 [2019-09-08 01:13:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:42,179 INFO L225 Difference]: With dead ends: 452 [2019-09-08 01:13:42,179 INFO L226 Difference]: Without dead ends: 447 [2019-09-08 01:13:42,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:13:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-09-08 01:13:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2019-09-08 01:13:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-09-08 01:13:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 614 transitions. [2019-09-08 01:13:42,187 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 614 transitions. Word has length 605 [2019-09-08 01:13:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:42,187 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 614 transitions. [2019-09-08 01:13:42,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-08 01:13:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 614 transitions. [2019-09-08 01:13:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-09-08 01:13:42,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:42,191 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:42,191 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash -433253711, now seen corresponding path program 86 times [2019-09-08 01:13:42,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:42,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:42,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:42,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:45,020 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:45,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:45,020 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:45,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:13:45,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:13:45,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:45,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1402 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-08 01:13:45,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:45,433 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:45,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:45,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-08 01:13:45,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-08 01:13:45,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-08 01:13:45,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:13:45,440 INFO L87 Difference]: Start difference. First operand 443 states and 614 transitions. Second operand 89 states. [2019-09-08 01:13:46,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:46,895 INFO L93 Difference]: Finished difference Result 457 states and 632 transitions. [2019-09-08 01:13:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 01:13:46,901 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 612 [2019-09-08 01:13:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:46,904 INFO L225 Difference]: With dead ends: 457 [2019-09-08 01:13:46,905 INFO L226 Difference]: Without dead ends: 452 [2019-09-08 01:13:46,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:13:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-08 01:13:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 448. [2019-09-08 01:13:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-08 01:13:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 621 transitions. [2019-09-08 01:13:46,914 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 621 transitions. Word has length 612 [2019-09-08 01:13:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:46,914 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 621 transitions. [2019-09-08 01:13:46,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-08 01:13:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 621 transitions. [2019-09-08 01:13:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2019-09-08 01:13:46,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:46,918 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:46,918 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash -895946598, now seen corresponding path program 87 times [2019-09-08 01:13:46,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:46,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:46,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:46,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:46,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:49,794 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:49,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:49,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 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:49,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:13:50,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-09-08 01:13:50,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:50,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-08 01:13:50,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:50,315 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:50,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:50,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-09-08 01:13:50,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-08 01:13:50,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-08 01:13:50,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:13:50,322 INFO L87 Difference]: Start difference. First operand 448 states and 621 transitions. Second operand 90 states. [2019-09-08 01:13:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:51,946 INFO L93 Difference]: Finished difference Result 462 states and 639 transitions. [2019-09-08 01:13:51,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-08 01:13:51,947 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 619 [2019-09-08 01:13:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:51,949 INFO L225 Difference]: With dead ends: 462 [2019-09-08 01:13:51,950 INFO L226 Difference]: Without dead ends: 457 [2019-09-08 01:13:51,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:13:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-08 01:13:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 453. [2019-09-08 01:13:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-09-08 01:13:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 628 transitions. [2019-09-08 01:13:51,957 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 628 transitions. Word has length 619 [2019-09-08 01:13:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:51,958 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 628 transitions. [2019-09-08 01:13:51,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-08 01:13:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 628 transitions. [2019-09-08 01:13:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-09-08 01:13:51,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:51,964 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:51,964 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:51,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:51,964 INFO L82 PathProgramCache]: Analyzing trace with hash 394021521, now seen corresponding path program 88 times [2019-09-08 01:13:51,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:51,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:54,904 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:54,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:54,905 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:54,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:13:55,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:13:55,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:55,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1434 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-08 01:13:55,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:55,322 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:55,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:55,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-08 01:13:55,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-08 01:13:55,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-08 01:13:55,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:13:55,328 INFO L87 Difference]: Start difference. First operand 453 states and 628 transitions. Second operand 91 states. [2019-09-08 01:13:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:56,483 INFO L93 Difference]: Finished difference Result 467 states and 646 transitions. [2019-09-08 01:13:56,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-08 01:13:56,484 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 626 [2019-09-08 01:13:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:56,486 INFO L225 Difference]: With dead ends: 467 [2019-09-08 01:13:56,486 INFO L226 Difference]: Without dead ends: 462 [2019-09-08 01:13:56,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:13:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-08 01:13:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 458. [2019-09-08 01:13:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-09-08 01:13:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 635 transitions. [2019-09-08 01:13:56,494 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 635 transitions. Word has length 626 [2019-09-08 01:13:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:56,494 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 635 transitions. [2019-09-08 01:13:56,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-08 01:13:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 635 transitions. [2019-09-08 01:13:56,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2019-09-08 01:13:56,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:56,498 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:56,499 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1743446854, now seen corresponding path program 89 times [2019-09-08 01:13:56,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:56,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:56,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:56,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:56,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:59,664 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:59,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:59,665 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:59,674 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:13:59,986 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-09-08 01:13:59,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:59,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-08 01:13:59,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:00,205 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:14:00,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:00,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-09-08 01:14:00,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-08 01:14:00,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-08 01:14:00,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 01:14:00,212 INFO L87 Difference]: Start difference. First operand 458 states and 635 transitions. Second operand 92 states. [2019-09-08 01:14:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:02,105 INFO L93 Difference]: Finished difference Result 472 states and 653 transitions. [2019-09-08 01:14:02,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-08 01:14:02,105 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 633 [2019-09-08 01:14:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:02,108 INFO L225 Difference]: With dead ends: 472 [2019-09-08 01:14:02,108 INFO L226 Difference]: Without dead ends: 467 [2019-09-08 01:14:02,109 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:14:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-08 01:14:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2019-09-08 01:14:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-08 01:14:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 642 transitions. [2019-09-08 01:14:02,119 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 642 transitions. Word has length 633 [2019-09-08 01:14:02,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:02,119 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 642 transitions. [2019-09-08 01:14:02,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-08 01:14:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 642 transitions. [2019-09-08 01:14:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2019-09-08 01:14:02,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:02,125 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:14:02,125 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:02,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:02,125 INFO L82 PathProgramCache]: Analyzing trace with hash 375143025, now seen corresponding path program 90 times [2019-09-08 01:14:02,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:02,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:02,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:02,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:02,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:05,260 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:14:05,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:05,261 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:14:05,271 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:14:05,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-09-08 01:14:05,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:05,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-08 01:14:05,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:05,827 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:14:05,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:05,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-08 01:14:05,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-08 01:14:05,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-08 01:14:05,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 01:14:05,834 INFO L87 Difference]: Start difference. First operand 463 states and 642 transitions. Second operand 93 states. [2019-09-08 01:14:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:07,519 INFO L93 Difference]: Finished difference Result 477 states and 660 transitions. [2019-09-08 01:14:07,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-08 01:14:07,519 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 640 [2019-09-08 01:14:07,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:07,522 INFO L225 Difference]: With dead ends: 477 [2019-09-08 01:14:07,522 INFO L226 Difference]: Without dead ends: 472 [2019-09-08 01:14:07,522 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:14:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-08 01:14:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 468. [2019-09-08 01:14:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-09-08 01:14:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 649 transitions. [2019-09-08 01:14:07,530 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 649 transitions. Word has length 640 [2019-09-08 01:14:07,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:07,531 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 649 transitions. [2019-09-08 01:14:07,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-08 01:14:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 649 transitions. [2019-09-08 01:14:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-09-08 01:14:07,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:07,535 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:14:07,535 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:07,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash 239177946, now seen corresponding path program 91 times [2019-09-08 01:14:07,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:07,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:07,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:07,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:07,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:10,752 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:10,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:10,753 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:10,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:10,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1482 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-08 01:14:10,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:11,171 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:11,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:11,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-08 01:14:11,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-08 01:14:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-08 01:14:11,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:14:11,178 INFO L87 Difference]: Start difference. First operand 468 states and 649 transitions. Second operand 94 states. [2019-09-08 01:14:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:13,116 INFO L93 Difference]: Finished difference Result 482 states and 667 transitions. [2019-09-08 01:14:13,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-08 01:14:13,117 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 647 [2019-09-08 01:14:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:13,120 INFO L225 Difference]: With dead ends: 482 [2019-09-08 01:14:13,120 INFO L226 Difference]: Without dead ends: 477 [2019-09-08 01:14:13,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:14:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-08 01:14:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 473. [2019-09-08 01:14:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-09-08 01:14:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 656 transitions. [2019-09-08 01:14:13,129 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 656 transitions. Word has length 647 [2019-09-08 01:14:13,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:13,130 INFO L475 AbstractCegarLoop]: Abstraction has 473 states and 656 transitions. [2019-09-08 01:14:13,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-08 01:14:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 656 transitions. [2019-09-08 01:14:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2019-09-08 01:14:13,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:13,134 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:13,134 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:13,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1691688367, now seen corresponding path program 92 times [2019-09-08 01:14:13,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:13,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:13,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:16,292 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:16,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:16,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 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:16,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:16,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:16,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:16,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-08 01:14:16,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:16,747 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:16,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:16,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-08 01:14:16,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-08 01:14:16,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-08 01:14:16,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:14:16,754 INFO L87 Difference]: Start difference. First operand 473 states and 656 transitions. Second operand 95 states. [2019-09-08 01:14:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:18,356 INFO L93 Difference]: Finished difference Result 487 states and 674 transitions. [2019-09-08 01:14:18,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 01:14:18,357 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 654 [2019-09-08 01:14:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:18,360 INFO L225 Difference]: With dead ends: 487 [2019-09-08 01:14:18,360 INFO L226 Difference]: Without dead ends: 482 [2019-09-08 01:14:18,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:14:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-08 01:14:18,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2019-09-08 01:14:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-09-08 01:14:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 663 transitions. [2019-09-08 01:14:18,375 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 663 transitions. Word has length 654 [2019-09-08 01:14:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:18,376 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 663 transitions. [2019-09-08 01:14:18,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-08 01:14:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 663 transitions. [2019-09-08 01:14:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-09-08 01:14:18,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:18,382 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:18,382 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash -285192966, now seen corresponding path program 93 times [2019-09-08 01:14:18,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:18,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:18,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:21,767 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:21,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:21,767 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:21,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:14:22,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-09-08 01:14:22,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:22,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-08 01:14:22,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:22,343 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:22,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:22,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-08 01:14:22,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-08 01:14:22,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-08 01:14:22,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 01:14:22,350 INFO L87 Difference]: Start difference. First operand 478 states and 663 transitions. Second operand 96 states. [2019-09-08 01:14:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:24,474 INFO L93 Difference]: Finished difference Result 492 states and 681 transitions. [2019-09-08 01:14:24,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-08 01:14:24,474 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 661 [2019-09-08 01:14:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:24,477 INFO L225 Difference]: With dead ends: 492 [2019-09-08 01:14:24,477 INFO L226 Difference]: Without dead ends: 487 [2019-09-08 01:14:24,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 01:14:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-08 01:14:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 483. [2019-09-08 01:14:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-08 01:14:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 670 transitions. [2019-09-08 01:14:24,485 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 670 transitions. Word has length 661 [2019-09-08 01:14:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:24,486 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 670 transitions. [2019-09-08 01:14:24,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-08 01:14:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 670 transitions. [2019-09-08 01:14:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-09-08 01:14:24,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:24,490 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:24,490 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:24,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:24,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1640383025, now seen corresponding path program 94 times [2019-09-08 01:14:24,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:24,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:24,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:24,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:24,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:27,801 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:27,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:27,801 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:27,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:14:27,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:14:27,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:28,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-08 01:14:28,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:28,272 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:28,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:28,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-08 01:14:28,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-08 01:14:28,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-08 01:14:28,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:14:28,279 INFO L87 Difference]: Start difference. First operand 483 states and 670 transitions. Second operand 97 states. [2019-09-08 01:14:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:29,960 INFO L93 Difference]: Finished difference Result 497 states and 688 transitions. [2019-09-08 01:14:29,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-08 01:14:29,960 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 668 [2019-09-08 01:14:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:29,963 INFO L225 Difference]: With dead ends: 497 [2019-09-08 01:14:29,964 INFO L226 Difference]: Without dead ends: 492 [2019-09-08 01:14:29,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:14:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-09-08 01:14:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 488. [2019-09-08 01:14:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 01:14:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 677 transitions. [2019-09-08 01:14:29,974 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 677 transitions. Word has length 668 [2019-09-08 01:14:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:29,974 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 677 transitions. [2019-09-08 01:14:29,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-08 01:14:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 677 transitions. [2019-09-08 01:14:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-09-08 01:14:29,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:29,980 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:29,981 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:29,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:29,981 INFO L82 PathProgramCache]: Analyzing trace with hash 145969434, now seen corresponding path program 95 times [2019-09-08 01:14:29,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:29,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:29,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:29,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:29,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:33,489 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:33,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:33,489 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:33,501 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:14:33,836 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-09-08 01:14:33,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:33,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-08 01:14:33,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:34,083 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:34,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:34,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-08 01:14:34,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-08 01:14:34,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-08 01:14:34,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:14:34,090 INFO L87 Difference]: Start difference. First operand 488 states and 677 transitions. Second operand 98 states. [2019-09-08 01:14:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:36,266 INFO L93 Difference]: Finished difference Result 502 states and 695 transitions. [2019-09-08 01:14:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-08 01:14:36,267 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 675 [2019-09-08 01:14:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:36,269 INFO L225 Difference]: With dead ends: 502 [2019-09-08 01:14:36,269 INFO L226 Difference]: Without dead ends: 497 [2019-09-08 01:14:36,270 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:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-08 01:14:36,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 493. [2019-09-08 01:14:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-08 01:14:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 684 transitions. [2019-09-08 01:14:36,276 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 684 transitions. Word has length 675 [2019-09-08 01:14:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:36,277 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 684 transitions. [2019-09-08 01:14:36,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-08 01:14:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 684 transitions. [2019-09-08 01:14:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2019-09-08 01:14:36,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:36,281 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:36,281 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:36,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:36,281 INFO L82 PathProgramCache]: Analyzing trace with hash 160193041, now seen corresponding path program 96 times [2019-09-08 01:14:36,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:36,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:36,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:39,790 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:39,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:39,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39,802 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:14:40,142 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-09-08 01:14:40,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:40,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-08 01:14:40,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:40,421 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:40,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:40,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-08 01:14:40,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-08 01:14:40,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-08 01:14:40,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:14:40,428 INFO L87 Difference]: Start difference. First operand 493 states and 684 transitions. Second operand 99 states. [2019-09-08 01:14:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:42,273 INFO L93 Difference]: Finished difference Result 507 states and 702 transitions. [2019-09-08 01:14:42,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-08 01:14:42,273 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 682 [2019-09-08 01:14:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:42,275 INFO L225 Difference]: With dead ends: 507 [2019-09-08 01:14:42,275 INFO L226 Difference]: Without dead ends: 502 [2019-09-08 01:14:42,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:14:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-08 01:14:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 498. [2019-09-08 01:14:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-09-08 01:14:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 691 transitions. [2019-09-08 01:14:42,284 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 691 transitions. Word has length 682 [2019-09-08 01:14:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:42,285 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 691 transitions. [2019-09-08 01:14:42,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-08 01:14:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 691 transitions. [2019-09-08 01:14:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-09-08 01:14:42,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:42,291 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:42,291 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1446812986, now seen corresponding path program 97 times [2019-09-08 01:14:42,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:42,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:42,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:45,955 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:45,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:45,956 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:45,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:46,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-08 01:14:46,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:46,410 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:46,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:46,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-08 01:14:46,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-08 01:14:46,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-08 01:14:46,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:14:46,416 INFO L87 Difference]: Start difference. First operand 498 states and 691 transitions. Second operand 100 states. [2019-09-08 01:14:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:48,554 INFO L93 Difference]: Finished difference Result 512 states and 709 transitions. [2019-09-08 01:14:48,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-08 01:14:48,554 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 689 [2019-09-08 01:14:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:48,556 INFO L225 Difference]: With dead ends: 512 [2019-09-08 01:14:48,556 INFO L226 Difference]: Without dead ends: 507 [2019-09-08 01:14:48,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:14:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-08 01:14:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2019-09-08 01:14:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-08 01:14:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 698 transitions. [2019-09-08 01:14:48,564 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 698 transitions. Word has length 689 [2019-09-08 01:14:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:48,591 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 698 transitions. [2019-09-08 01:14:48,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-08 01:14:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 698 transitions. [2019-09-08 01:14:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-09-08 01:14:48,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:48,597 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:48,598 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:48,598 INFO L82 PathProgramCache]: Analyzing trace with hash -178574863, now seen corresponding path program 98 times [2019-09-08 01:14:48,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:48,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:48,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:48,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:48,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:52,134 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:52,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:52,135 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:52,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:52,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:52,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:52,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 1594 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-08 01:14:52,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:52,628 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:52,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:52,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-08 01:14:52,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-08 01:14:52,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-08 01:14:52,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:14:52,634 INFO L87 Difference]: Start difference. First operand 503 states and 698 transitions. Second operand 101 states. [2019-09-08 01:14:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:54,728 INFO L93 Difference]: Finished difference Result 517 states and 716 transitions. [2019-09-08 01:14:54,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 01:14:54,728 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 696 [2019-09-08 01:14:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:54,730 INFO L225 Difference]: With dead ends: 517 [2019-09-08 01:14:54,730 INFO L226 Difference]: Without dead ends: 512 [2019-09-08 01:14:54,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:14:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-08 01:14:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 508. [2019-09-08 01:14:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-09-08 01:14:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 705 transitions. [2019-09-08 01:14:54,740 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 705 transitions. Word has length 696 [2019-09-08 01:14:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:54,740 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 705 transitions. [2019-09-08 01:14:54,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-08 01:14:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 705 transitions. [2019-09-08 01:14:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-09-08 01:14:54,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:54,745 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:54,745 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:54,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:54,745 INFO L82 PathProgramCache]: Analyzing trace with hash 519975258, now seen corresponding path program 99 times [2019-09-08 01:14:54,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:54,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:54,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:54,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:54,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:58,502 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:58,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:58,503 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:58,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:14:58,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-09-08 01:14:58,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:58,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-08 01:14:58,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:59,210 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:59,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:59,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-08 01:14:59,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-08 01:14:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-08 01:14:59,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 01:14:59,218 INFO L87 Difference]: Start difference. First operand 508 states and 705 transitions. Second operand 102 states. [2019-09-08 01:15:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:01,576 INFO L93 Difference]: Finished difference Result 522 states and 723 transitions. [2019-09-08 01:15:01,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-08 01:15:01,576 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 703 [2019-09-08 01:15:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:01,578 INFO L225 Difference]: With dead ends: 522 [2019-09-08 01:15:01,578 INFO L226 Difference]: Without dead ends: 517 [2019-09-08 01:15:01,578 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:15:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-08 01:15:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 513. [2019-09-08 01:15:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-09-08 01:15:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 712 transitions. [2019-09-08 01:15:01,587 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 712 transitions. Word has length 703 [2019-09-08 01:15:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:01,588 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 712 transitions. [2019-09-08 01:15:01,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-08 01:15:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 712 transitions. [2019-09-08 01:15:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2019-09-08 01:15:01,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:01,593 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:15:01,593 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:01,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:01,594 INFO L82 PathProgramCache]: Analyzing trace with hash 730902993, now seen corresponding path program 100 times [2019-09-08 01:15:01,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:01,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:01,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:01,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:01,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:05,472 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:05,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:05,473 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:05,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:15:05,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:15:05,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:05,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-08 01:15:05,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:05,961 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:05,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:05,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2019-09-08 01:15:05,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-08 01:15:05,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-08 01:15:05,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 01:15:05,967 INFO L87 Difference]: Start difference. First operand 513 states and 712 transitions. Second operand 103 states. [2019-09-08 01:15:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:07,961 INFO L93 Difference]: Finished difference Result 527 states and 730 transitions. [2019-09-08 01:15:07,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-08 01:15:07,962 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 710 [2019-09-08 01:15:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:07,964 INFO L225 Difference]: With dead ends: 527 [2019-09-08 01:15:07,964 INFO L226 Difference]: Without dead ends: 522 [2019-09-08 01:15:07,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 01:15:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-08 01:15:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 518. [2019-09-08 01:15:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-09-08 01:15:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 719 transitions. [2019-09-08 01:15:07,975 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 719 transitions. Word has length 710 [2019-09-08 01:15:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:07,975 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 719 transitions. [2019-09-08 01:15:07,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-08 01:15:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 719 transitions. [2019-09-08 01:15:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-09-08 01:15:07,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:07,981 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:07,981 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:07,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:07,982 INFO L82 PathProgramCache]: Analyzing trace with hash 383389050, now seen corresponding path program 101 times [2019-09-08 01:15:07,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:07,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:07,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:07,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:11,849 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:11,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:11,850 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:11,860 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:15:12,245 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2019-09-08 01:15:12,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:12,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-08 01:15:12,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:12,528 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:12,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:12,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2019-09-08 01:15:12,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-08 01:15:12,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-08 01:15:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-08 01:15:12,536 INFO L87 Difference]: Start difference. First operand 518 states and 719 transitions. Second operand 104 states. [2019-09-08 01:15:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:15,174 INFO L93 Difference]: Finished difference Result 532 states and 737 transitions. [2019-09-08 01:15:15,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-08 01:15:15,174 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 717 [2019-09-08 01:15:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:15,176 INFO L225 Difference]: With dead ends: 532 [2019-09-08 01:15:15,176 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 01:15:15,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-08 01:15:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 01:15:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2019-09-08 01:15:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-09-08 01:15:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 726 transitions. [2019-09-08 01:15:15,185 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 726 transitions. Word has length 717 [2019-09-08 01:15:15,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:15,185 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 726 transitions. [2019-09-08 01:15:15,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-08 01:15:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 726 transitions. [2019-09-08 01:15:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2019-09-08 01:15:15,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:15,189 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:15,189 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:15,189 INFO L82 PathProgramCache]: Analyzing trace with hash 906686897, now seen corresponding path program 102 times [2019-09-08 01:15:15,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:15,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:15,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:19,123 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:19,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:19,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 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:19,134 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:15:19,507 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2019-09-08 01:15:19,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:19,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-08 01:15:19,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:19,806 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:19,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:19,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2019-09-08 01:15:19,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-08 01:15:19,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-08 01:15:19,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-09-08 01:15:19,813 INFO L87 Difference]: Start difference. First operand 523 states and 726 transitions. Second operand 105 states. [2019-09-08 01:15:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:21,504 INFO L93 Difference]: Finished difference Result 537 states and 744 transitions. [2019-09-08 01:15:21,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-08 01:15:21,504 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 724 [2019-09-08 01:15:21,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:21,506 INFO L225 Difference]: With dead ends: 537 [2019-09-08 01:15:21,506 INFO L226 Difference]: Without dead ends: 532 [2019-09-08 01:15:21,507 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:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-09-08 01:15:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 528. [2019-09-08 01:15:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-08 01:15:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 733 transitions. [2019-09-08 01:15:21,514 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 733 transitions. Word has length 724 [2019-09-08 01:15:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:21,515 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 733 transitions. [2019-09-08 01:15:21,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-08 01:15:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 733 transitions. [2019-09-08 01:15:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2019-09-08 01:15:21,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:21,519 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:21,519 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2117218714, now seen corresponding path program 103 times [2019-09-08 01:15:21,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:21,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:21,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:25,544 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:25,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:25,544 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:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:15:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:25,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-08 01:15:25,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:26,090 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:26,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:26,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2019-09-08 01:15:26,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-08 01:15:26,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-08 01:15:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 01:15:26,097 INFO L87 Difference]: Start difference. First operand 528 states and 733 transitions. Second operand 106 states. [2019-09-08 01:15:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:28,048 INFO L93 Difference]: Finished difference Result 542 states and 751 transitions. [2019-09-08 01:15:28,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-08 01:15:28,048 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 731 [2019-09-08 01:15:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:28,050 INFO L225 Difference]: With dead ends: 542 [2019-09-08 01:15:28,050 INFO L226 Difference]: Without dead ends: 537 [2019-09-08 01:15:28,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 01:15:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-08 01:15:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2019-09-08 01:15:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-09-08 01:15:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 740 transitions. [2019-09-08 01:15:28,060 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 740 transitions. Word has length 731 [2019-09-08 01:15:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:28,061 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 740 transitions. [2019-09-08 01:15:28,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-08 01:15:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 740 transitions. [2019-09-08 01:15:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2019-09-08 01:15:28,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:28,067 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:28,067 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:28,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:28,068 INFO L82 PathProgramCache]: Analyzing trace with hash 36170129, now seen corresponding path program 104 times [2019-09-08 01:15:28,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:28,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:28,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:15:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:32,387 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:32,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:32,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:15:32,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:15:32,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:32,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-08 01:15:32,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:32,961 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:32,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:32,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2019-09-08 01:15:32,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-08 01:15:32,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-08 01:15:32,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-08 01:15:32,968 INFO L87 Difference]: Start difference. First operand 533 states and 740 transitions. Second operand 107 states. [2019-09-08 01:15:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:34,675 INFO L93 Difference]: Finished difference Result 547 states and 758 transitions. [2019-09-08 01:15:34,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-08 01:15:34,676 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 738 [2019-09-08 01:15:34,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:34,677 INFO L225 Difference]: With dead ends: 547 [2019-09-08 01:15:34,677 INFO L226 Difference]: Without dead ends: 542 [2019-09-08 01:15:34,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-08 01:15:34,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-08 01:15:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 538. [2019-09-08 01:15:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-09-08 01:15:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 747 transitions. [2019-09-08 01:15:34,687 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 747 transitions. Word has length 738 [2019-09-08 01:15:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:34,688 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 747 transitions. [2019-09-08 01:15:34,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-08 01:15:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 747 transitions. [2019-09-08 01:15:34,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2019-09-08 01:15:34,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:34,693 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:34,693 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:34,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:34,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1105763770, now seen corresponding path program 105 times [2019-09-08 01:15:34,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:34,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:34,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:34,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:34,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:38,957 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:38,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:38,958 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:38,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:15:39,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2019-09-08 01:15:39,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:39,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-08 01:15:39,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:39,668 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:39,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:39,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2019-09-08 01:15:39,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-08 01:15:39,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-08 01:15:39,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-08 01:15:39,676 INFO L87 Difference]: Start difference. First operand 538 states and 747 transitions. Second operand 108 states. [2019-09-08 01:15:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:41,297 INFO L93 Difference]: Finished difference Result 552 states and 765 transitions. [2019-09-08 01:15:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-08 01:15:41,297 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 745 [2019-09-08 01:15:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:41,299 INFO L225 Difference]: With dead ends: 552 [2019-09-08 01:15:41,299 INFO L226 Difference]: Without dead ends: 547 [2019-09-08 01:15:41,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-08 01:15:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-08 01:15:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 543. [2019-09-08 01:15:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-08 01:15:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 754 transitions. [2019-09-08 01:15:41,309 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 754 transitions. Word has length 745 [2019-09-08 01:15:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:41,310 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 754 transitions. [2019-09-08 01:15:41,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-08 01:15:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 754 transitions. [2019-09-08 01:15:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2019-09-08 01:15:41,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:41,316 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:41,316 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1060791951, now seen corresponding path program 106 times [2019-09-08 01:15:41,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:41,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:41,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:45,737 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:45,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:45,738 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:45,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:15:45,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:15:45,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:45,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 1722 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-08 01:15:45,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:46,278 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:46,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:46,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2019-09-08 01:15:46,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-08 01:15:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-08 01:15:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 01:15:46,285 INFO L87 Difference]: Start difference. First operand 543 states and 754 transitions. Second operand 109 states. [2019-09-08 01:15:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:48,322 INFO L93 Difference]: Finished difference Result 557 states and 772 transitions. [2019-09-08 01:15:48,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-08 01:15:48,323 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 752 [2019-09-08 01:15:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:48,325 INFO L225 Difference]: With dead ends: 557 [2019-09-08 01:15:48,325 INFO L226 Difference]: Without dead ends: 552 [2019-09-08 01:15:48,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 753 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 01:15:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-08 01:15:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 548. [2019-09-08 01:15:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-09-08 01:15:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 761 transitions. [2019-09-08 01:15:48,332 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 761 transitions. Word has length 752 [2019-09-08 01:15:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:48,332 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 761 transitions. [2019-09-08 01:15:48,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-08 01:15:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 761 transitions. [2019-09-08 01:15:48,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2019-09-08 01:15:48,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:48,337 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:48,337 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:48,337 INFO L82 PathProgramCache]: Analyzing trace with hash 459231706, now seen corresponding path program 107 times [2019-09-08 01:15:48,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:48,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:48,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:48,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:48,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:52,845 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:52,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:52,845 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:52,881 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:15:53,284 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2019-09-08 01:15:53,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:53,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 1738 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-08 01:15:53,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:53,594 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:53,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:53,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2019-09-08 01:15:53,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-08 01:15:53,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-08 01:15:53,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 01:15:53,603 INFO L87 Difference]: Start difference. First operand 548 states and 761 transitions. Second operand 110 states. [2019-09-08 01:15:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:54,984 INFO L93 Difference]: Finished difference Result 562 states and 779 transitions. [2019-09-08 01:15:54,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-08 01:15:54,984 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 759 [2019-09-08 01:15:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:54,986 INFO L225 Difference]: With dead ends: 562 [2019-09-08 01:15:54,986 INFO L226 Difference]: Without dead ends: 557 [2019-09-08 01:15:54,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 01:15:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-08 01:15:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2019-09-08 01:15:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-09-08 01:15:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 768 transitions. [2019-09-08 01:15:54,997 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 768 transitions. Word has length 759 [2019-09-08 01:15:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:54,998 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 768 transitions. [2019-09-08 01:15:54,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-08 01:15:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 768 transitions. [2019-09-08 01:15:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2019-09-08 01:15:55,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:55,005 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:55,005 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:55,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:55,006 INFO L82 PathProgramCache]: Analyzing trace with hash -968752815, now seen corresponding path program 108 times [2019-09-08 01:15:55,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:55,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:55,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:55,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:55,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:59,565 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:59,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:59,566 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:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:15:59,991 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2019-09-08 01:15:59,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:59,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1754 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-08 01:16:00,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:00,346 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:16:00,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:00,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2019-09-08 01:16:00,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-08 01:16:00,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-08 01:16:00,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-09-08 01:16:00,354 INFO L87 Difference]: Start difference. First operand 553 states and 768 transitions. Second operand 111 states. [2019-09-08 01:16:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:02,585 INFO L93 Difference]: Finished difference Result 567 states and 786 transitions. [2019-09-08 01:16:02,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-08 01:16:02,585 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 766 [2019-09-08 01:16:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:02,587 INFO L225 Difference]: With dead ends: 567 [2019-09-08 01:16:02,587 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 01:16:02,588 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:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 01:16:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 558. [2019-09-08 01:16:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-08 01:16:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 775 transitions. [2019-09-08 01:16:02,596 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 775 transitions. Word has length 766 [2019-09-08 01:16:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:02,597 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 775 transitions. [2019-09-08 01:16:02,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-08 01:16:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 775 transitions. [2019-09-08 01:16:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2019-09-08 01:16:02,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:02,601 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:02,602 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:02,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1334292998, now seen corresponding path program 109 times [2019-09-08 01:16:02,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:02,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:02,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:02,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:02,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:07,168 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:07,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:07,169 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:07,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:07,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1770 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-08 01:16:07,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:07,724 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:07,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:07,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2019-09-08 01:16:07,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-08 01:16:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-08 01:16:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-08 01:16:07,731 INFO L87 Difference]: Start difference. First operand 558 states and 775 transitions. Second operand 112 states. [2019-09-08 01:16:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:09,212 INFO L93 Difference]: Finished difference Result 572 states and 793 transitions. [2019-09-08 01:16:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-08 01:16:09,213 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 773 [2019-09-08 01:16:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:09,215 INFO L225 Difference]: With dead ends: 572 [2019-09-08 01:16:09,215 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 01:16:09,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 774 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-08 01:16:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 01:16:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 563. [2019-09-08 01:16:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-08 01:16:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 782 transitions. [2019-09-08 01:16:09,225 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 782 transitions. Word has length 773 [2019-09-08 01:16:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:09,226 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 782 transitions. [2019-09-08 01:16:09,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-08 01:16:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 782 transitions. [2019-09-08 01:16:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-09-08 01:16:09,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:09,233 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:09,234 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1786454321, now seen corresponding path program 110 times [2019-09-08 01:16:09,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:09,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:14,292 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:14,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:14,292 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:14,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:14,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:14,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:14,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-08 01:16:14,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:14,858 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:14,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:14,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2019-09-08 01:16:14,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-08 01:16:14,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-08 01:16:14,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-08 01:16:14,866 INFO L87 Difference]: Start difference. First operand 563 states and 782 transitions. Second operand 113 states. [2019-09-08 01:16:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:17,005 INFO L93 Difference]: Finished difference Result 577 states and 800 transitions. [2019-09-08 01:16:17,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-08 01:16:17,005 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 780 [2019-09-08 01:16:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:17,007 INFO L225 Difference]: With dead ends: 577 [2019-09-08 01:16:17,007 INFO L226 Difference]: Without dead ends: 572 [2019-09-08 01:16:17,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 781 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-08 01:16:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-08 01:16:17,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 568. [2019-09-08 01:16:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 01:16:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 789 transitions. [2019-09-08 01:16:17,018 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 789 transitions. Word has length 780 [2019-09-08 01:16:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:17,019 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 789 transitions. [2019-09-08 01:16:17,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-08 01:16:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 789 transitions. [2019-09-08 01:16:17,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2019-09-08 01:16:17,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:17,026 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:17,027 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:17,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:17,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1282043366, now seen corresponding path program 111 times [2019-09-08 01:16:17,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:17,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:17,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:17,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:17,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:21,771 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,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:21,772 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:21,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:22,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2019-09-08 01:16:22,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:22,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 1802 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-08 01:16:22,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:22,598 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:22,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:22,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2019-09-08 01:16:22,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-08 01:16:22,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-08 01:16:22,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-08 01:16:22,607 INFO L87 Difference]: Start difference. First operand 568 states and 789 transitions. Second operand 114 states. [2019-09-08 01:16:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:24,716 INFO L93 Difference]: Finished difference Result 582 states and 807 transitions. [2019-09-08 01:16:24,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-08 01:16:24,717 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 787 [2019-09-08 01:16:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:24,718 INFO L225 Difference]: With dead ends: 582 [2019-09-08 01:16:24,718 INFO L226 Difference]: Without dead ends: 577 [2019-09-08 01:16:24,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-08 01:16:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-08 01:16:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 573. [2019-09-08 01:16:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-08 01:16:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 796 transitions. [2019-09-08 01:16:24,726 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 796 transitions. Word has length 787 [2019-09-08 01:16:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:24,726 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 796 transitions. [2019-09-08 01:16:24,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-08 01:16:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 796 transitions. [2019-09-08 01:16:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2019-09-08 01:16:24,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:24,731 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:24,732 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:24,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:24,732 INFO L82 PathProgramCache]: Analyzing trace with hash -389089007, now seen corresponding path program 112 times [2019-09-08 01:16:24,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:24,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:24,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:24,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:24,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:29,794 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,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:29,794 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:29,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:30,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:30,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:30,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 1818 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-08 01:16:30,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:30,383 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:30,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:30,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2019-09-08 01:16:30,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-08 01:16:30,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-08 01:16:30,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 01:16:30,417 INFO L87 Difference]: Start difference. First operand 573 states and 796 transitions. Second operand 115 states. [2019-09-08 01:16:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:32,484 INFO L93 Difference]: Finished difference Result 587 states and 814 transitions. [2019-09-08 01:16:32,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-08 01:16:32,485 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 794 [2019-09-08 01:16:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:32,487 INFO L225 Difference]: With dead ends: 587 [2019-09-08 01:16:32,487 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 01:16:32,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 01:16:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 01:16:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 578. [2019-09-08 01:16:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-08 01:16:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 803 transitions. [2019-09-08 01:16:32,497 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 803 transitions. Word has length 794 [2019-09-08 01:16:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:32,498 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 803 transitions. [2019-09-08 01:16:32,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-08 01:16:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 803 transitions. [2019-09-08 01:16:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2019-09-08 01:16:32,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:32,506 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:32,506 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:32,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash 60366394, now seen corresponding path program 113 times [2019-09-08 01:16:32,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:32,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:32,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:37,645 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,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:37,646 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:37,656 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:38,104 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2019-09-08 01:16:38,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:38,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1834 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-08 01:16:38,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:38,466 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:38,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:38,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2019-09-08 01:16:38,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-08 01:16:38,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-08 01:16:38,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-08 01:16:38,475 INFO L87 Difference]: Start difference. First operand 578 states and 803 transitions. Second operand 116 states. [2019-09-08 01:16:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:40,920 INFO L93 Difference]: Finished difference Result 592 states and 821 transitions. [2019-09-08 01:16:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-08 01:16:40,920 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 801 [2019-09-08 01:16:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:40,931 INFO L225 Difference]: With dead ends: 592 [2019-09-08 01:16:40,931 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 01:16:40,932 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,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 01:16:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 583. [2019-09-08 01:16:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 01:16:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 810 transitions. [2019-09-08 01:16:40,943 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 810 transitions. Word has length 801 [2019-09-08 01:16:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:40,944 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 810 transitions. [2019-09-08 01:16:40,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-08 01:16:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 810 transitions. [2019-09-08 01:16:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-09-08 01:16:40,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:40,952 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,952 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1075546353, now seen corresponding path program 114 times [2019-09-08 01:16:40,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:40,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:40,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:40,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:40,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:45,992 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,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:45,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 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:46,003 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:16:46,454 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2019-09-08 01:16:46,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:46,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-08 01:16:46,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:46,845 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,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:46,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2019-09-08 01:16:46,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-08 01:16:46,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-08 01:16:46,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 01:16:46,854 INFO L87 Difference]: Start difference. First operand 583 states and 810 transitions. Second operand 117 states. [2019-09-08 01:16:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:48,361 INFO L93 Difference]: Finished difference Result 597 states and 828 transitions. [2019-09-08 01:16:48,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-08 01:16:48,361 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 808 [2019-09-08 01:16:48,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:48,363 INFO L225 Difference]: With dead ends: 597 [2019-09-08 01:16:48,363 INFO L226 Difference]: Without dead ends: 592 [2019-09-08 01:16:48,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 01:16:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-08 01:16:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2019-09-08 01:16:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-09-08 01:16:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 817 transitions. [2019-09-08 01:16:48,371 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 817 transitions. Word has length 808 [2019-09-08 01:16:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:48,372 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 817 transitions. [2019-09-08 01:16:48,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-08 01:16:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 817 transitions. [2019-09-08 01:16:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2019-09-08 01:16:48,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:48,377 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,377 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash -874188198, now seen corresponding path program 115 times [2019-09-08 01:16:48,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:48,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:48,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:48,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:48,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:53,706 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,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:53,707 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,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:53,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1866 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-08 01:16:53,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:54,420 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,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:54,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2019-09-08 01:16:54,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-08 01:16:54,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-08 01:16:54,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 01:16:54,430 INFO L87 Difference]: Start difference. First operand 588 states and 817 transitions. Second operand 118 states. [2019-09-08 01:16:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:57,408 INFO L93 Difference]: Finished difference Result 602 states and 835 transitions. [2019-09-08 01:16:57,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-08 01:16:57,408 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 815 [2019-09-08 01:16:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:57,410 INFO L225 Difference]: With dead ends: 602 [2019-09-08 01:16:57,410 INFO L226 Difference]: Without dead ends: 597 [2019-09-08 01:16:57,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 816 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 01:16:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-08 01:16:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 593. [2019-09-08 01:16:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-08 01:16:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 824 transitions. [2019-09-08 01:16:57,419 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 824 transitions. Word has length 815 [2019-09-08 01:16:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:57,419 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 824 transitions. [2019-09-08 01:16:57,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-08 01:16:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 824 transitions. [2019-09-08 01:16:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2019-09-08 01:16:57,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:57,425 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,425 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:57,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:57,425 INFO L82 PathProgramCache]: Analyzing trace with hash 314495185, now seen corresponding path program 116 times [2019-09-08 01:16:57,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:57,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:57,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:57,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:57,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:02,583 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,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:02,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:17:02,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:17:02,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:02,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-08 01:17:02,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:03,186 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,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:03,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2019-09-08 01:17:03,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-08 01:17:03,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-08 01:17:03,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-08 01:17:03,193 INFO L87 Difference]: Start difference. First operand 593 states and 824 transitions. Second operand 119 states. [2019-09-08 01:17:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:05,039 INFO L93 Difference]: Finished difference Result 607 states and 842 transitions. [2019-09-08 01:17:05,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-08 01:17:05,040 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 822 [2019-09-08 01:17:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:05,042 INFO L225 Difference]: With dead ends: 607 [2019-09-08 01:17:05,042 INFO L226 Difference]: Without dead ends: 602 [2019-09-08 01:17:05,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 823 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-08 01:17:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-08 01:17:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2019-09-08 01:17:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-08 01:17:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 831 transitions. [2019-09-08 01:17:05,054 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 831 transitions. Word has length 822 [2019-09-08 01:17:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:05,055 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 831 transitions. [2019-09-08 01:17:05,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-08 01:17:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 831 transitions. [2019-09-08 01:17:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2019-09-08 01:17:05,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:05,063 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,063 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1537536390, now seen corresponding path program 117 times [2019-09-08 01:17:05,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:05,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:05,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:05,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:05,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:10,251 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,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:10,251 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,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:17:10,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 118 check-sat command(s) [2019-09-08 01:17:10,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:10,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-08 01:17:10,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:11,167 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,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:11,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2019-09-08 01:17:11,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-08 01:17:11,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-08 01:17:11,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-08 01:17:11,175 INFO L87 Difference]: Start difference. First operand 598 states and 831 transitions. Second operand 120 states. [2019-09-08 01:17:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:13,703 INFO L93 Difference]: Finished difference Result 612 states and 849 transitions. [2019-09-08 01:17:13,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-08 01:17:13,703 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 829 [2019-09-08 01:17:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:13,705 INFO L225 Difference]: With dead ends: 612 [2019-09-08 01:17:13,705 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 01:17:13,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 830 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-08 01:17:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 01:17:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-09-08 01:17:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 01:17:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 838 transitions. [2019-09-08 01:17:13,712 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 838 transitions. Word has length 829 [2019-09-08 01:17:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:13,713 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 838 transitions. [2019-09-08 01:17:13,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-08 01:17:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 838 transitions. [2019-09-08 01:17:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2019-09-08 01:17:13,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:13,718 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:13,718 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:13,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2036936527, now seen corresponding path program 118 times [2019-09-08 01:17:13,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:13,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:13,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:13,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:13,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:19,129 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:19,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:19,130 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:19,142 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:17:19,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:17:19,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:19,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1914 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-08 01:17:19,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:19,746 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:19,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:19,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2019-09-08 01:17:19,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-08 01:17:19,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-08 01:17:19,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-08 01:17:19,754 INFO L87 Difference]: Start difference. First operand 603 states and 838 transitions. Second operand 121 states. [2019-09-08 01:17:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:22,526 INFO L93 Difference]: Finished difference Result 617 states and 856 transitions. [2019-09-08 01:17:22,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-08 01:17:22,526 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 836 [2019-09-08 01:17:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:22,528 INFO L225 Difference]: With dead ends: 617 [2019-09-08 01:17:22,528 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 01:17:22,529 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:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 01:17:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2019-09-08 01:17:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-08 01:17:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 845 transitions. [2019-09-08 01:17:22,536 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 845 transitions. Word has length 836 [2019-09-08 01:17:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:22,537 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 845 transitions. [2019-09-08 01:17:22,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-08 01:17:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 845 transitions. [2019-09-08 01:17:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2019-09-08 01:17:22,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:22,542 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:22,542 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:22,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:22,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1319275878, now seen corresponding path program 119 times [2019-09-08 01:17:22,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:22,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:22,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:27,987 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:27,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:27,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27,998 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:17:28,502 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 120 check-sat command(s) [2019-09-08 01:17:28,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:28,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-08 01:17:28,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:28,879 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:28,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:28,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 122 [2019-09-08 01:17:28,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-08 01:17:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-08 01:17:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-08 01:17:28,889 INFO L87 Difference]: Start difference. First operand 608 states and 845 transitions. Second operand 122 states. [2019-09-08 01:17:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:32,282 INFO L93 Difference]: Finished difference Result 622 states and 863 transitions. [2019-09-08 01:17:32,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-08 01:17:32,282 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 843 [2019-09-08 01:17:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:32,284 INFO L225 Difference]: With dead ends: 622 [2019-09-08 01:17:32,284 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 01:17:32,285 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:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 01:17:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-09-08 01:17:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-08 01:17:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 852 transitions. [2019-09-08 01:17:32,294 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 852 transitions. Word has length 843 [2019-09-08 01:17:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:32,295 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 852 transitions. [2019-09-08 01:17:32,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-08 01:17:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 852 transitions. [2019-09-08 01:17:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2019-09-08 01:17:32,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:32,303 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:32,303 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash 620857489, now seen corresponding path program 120 times [2019-09-08 01:17:32,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:32,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:32,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:32,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:32,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:37,838 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:37,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:37,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:37,850 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:17:38,450 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 121 check-sat command(s) [2019-09-08 01:17:38,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:38,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 1946 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-08 01:17:38,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:39,115 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,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:39,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2019-09-08 01:17:39,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-08 01:17:39,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-08 01:17:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-08 01:17:39,125 INFO L87 Difference]: Start difference. First operand 613 states and 852 transitions. Second operand 123 states. [2019-09-08 01:17:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:42,728 INFO L93 Difference]: Finished difference Result 627 states and 870 transitions. [2019-09-08 01:17:42,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-08 01:17:42,729 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 850 [2019-09-08 01:17:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:42,731 INFO L225 Difference]: With dead ends: 627 [2019-09-08 01:17:42,731 INFO L226 Difference]: Without dead ends: 622 [2019-09-08 01:17:42,732 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:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-08 01:17:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 618. [2019-09-08 01:17:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 01:17:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 859 transitions. [2019-09-08 01:17:42,739 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 859 transitions. Word has length 850 [2019-09-08 01:17:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:42,740 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 859 transitions. [2019-09-08 01:17:42,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-08 01:17:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 859 transitions. [2019-09-08 01:17:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2019-09-08 01:17:42,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:42,746 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:42,746 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:42,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1009901894, now seen corresponding path program 121 times [2019-09-08 01:17:42,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:42,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:42,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:42,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:42,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:48,514 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:48,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:48,514 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:48,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:48,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-08 01:17:48,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:49,217 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:49,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:49,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 124 [2019-09-08 01:17:49,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-08 01:17:49,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-08 01:17:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-08 01:17:49,227 INFO L87 Difference]: Start difference. First operand 618 states and 859 transitions. Second operand 124 states. [2019-09-08 01:17:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:52,668 INFO L93 Difference]: Finished difference Result 632 states and 877 transitions. [2019-09-08 01:17:52,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-08 01:17:52,673 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 857 [2019-09-08 01:17:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:52,676 INFO L225 Difference]: With dead ends: 632 [2019-09-08 01:17:52,676 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 01:17:52,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 858 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-08 01:17:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 01:17:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 623. [2019-09-08 01:17:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 01:17:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 866 transitions. [2019-09-08 01:17:52,689 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 866 transitions. Word has length 857 [2019-09-08 01:17:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:52,690 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 866 transitions. [2019-09-08 01:17:52,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-08 01:17:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 866 transitions. [2019-09-08 01:17:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2019-09-08 01:17:52,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:52,700 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:52,700 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:52,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1159923599, now seen corresponding path program 122 times [2019-09-08 01:17:52,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:52,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:52,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:58,607 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:17:58,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:58,608 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:17:58,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:17:58,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:17:58,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:58,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 1978 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-08 01:17:58,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:59,278 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:17:59,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:59,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2019-09-08 01:17:59,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-08 01:17:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-08 01:17:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-08 01:17:59,285 INFO L87 Difference]: Start difference. First operand 623 states and 866 transitions. Second operand 125 states. [2019-09-08 01:18:03,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:03,136 INFO L93 Difference]: Finished difference Result 637 states and 884 transitions. [2019-09-08 01:18:03,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-08 01:18:03,137 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 864 [2019-09-08 01:18:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:03,138 INFO L225 Difference]: With dead ends: 637 [2019-09-08 01:18:03,138 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 01:18:03,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 988 GetRequests, 865 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-08 01:18:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 01:18:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 628. [2019-09-08 01:18:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 01:18:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 873 transitions. [2019-09-08 01:18:03,145 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 873 transitions. Word has length 864 [2019-09-08 01:18:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:03,146 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 873 transitions. [2019-09-08 01:18:03,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-08 01:18:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 873 transitions. [2019-09-08 01:18:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2019-09-08 01:18:03,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:03,153 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:03,153 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:03,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2031031002, now seen corresponding path program 123 times [2019-09-08 01:18:03,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:03,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:03,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:03,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:03,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:09,191 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:09,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:09,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 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:09,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:18:09,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2019-09-08 01:18:09,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:09,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 1994 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-08 01:18:09,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:10,200 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,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:10,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 126 [2019-09-08 01:18:10,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-08 01:18:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-08 01:18:10,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 01:18:10,209 INFO L87 Difference]: Start difference. First operand 628 states and 873 transitions. Second operand 126 states. [2019-09-08 01:18:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:14,699 INFO L93 Difference]: Finished difference Result 642 states and 891 transitions. [2019-09-08 01:18:14,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-08 01:18:14,700 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 871 [2019-09-08 01:18:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:14,701 INFO L225 Difference]: With dead ends: 642 [2019-09-08 01:18:14,701 INFO L226 Difference]: Without dead ends: 637 [2019-09-08 01:18:14,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 01:18:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-08 01:18:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2019-09-08 01:18:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 01:18:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 880 transitions. [2019-09-08 01:18:14,709 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 880 transitions. Word has length 871 [2019-09-08 01:18:14,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:14,709 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 880 transitions. [2019-09-08 01:18:14,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-08 01:18:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 880 transitions. [2019-09-08 01:18:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2019-09-08 01:18:14,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:14,715 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:14,715 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:14,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash 948379729, now seen corresponding path program 124 times [2019-09-08 01:18:14,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:14,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:14,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:20,440 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:20,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:20,440 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:20,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:18:20,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:18:20,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:20,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 2010 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-08 01:18:20,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:21,138 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,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:21,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2019-09-08 01:18:21,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-08 01:18:21,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-08 01:18:21,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-08 01:18:21,146 INFO L87 Difference]: Start difference. First operand 633 states and 880 transitions. Second operand 127 states. [2019-09-08 01:18:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:25,394 INFO L93 Difference]: Finished difference Result 647 states and 898 transitions. [2019-09-08 01:18:25,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-08 01:18:25,394 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 878 [2019-09-08 01:18:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:25,395 INFO L225 Difference]: With dead ends: 647 [2019-09-08 01:18:25,395 INFO L226 Difference]: Without dead ends: 642 [2019-09-08 01:18:25,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1004 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-08 01:18:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-08 01:18:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 638. [2019-09-08 01:18:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 01:18:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 887 transitions. [2019-09-08 01:18:25,403 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 887 transitions. Word has length 878 [2019-09-08 01:18:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:25,403 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 887 transitions. [2019-09-08 01:18:25,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-08 01:18:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 887 transitions. [2019-09-08 01:18:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2019-09-08 01:18:25,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:25,409 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:25,410 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:25,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:25,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1526877946, now seen corresponding path program 125 times [2019-09-08 01:18:25,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:25,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:25,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:25,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:25,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:31,260 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:31,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:31,260 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:31,271 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:18:31,795 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 126 check-sat command(s) [2019-09-08 01:18:31,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:31,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 2026 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-08 01:18:31,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:32,201 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,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:32,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 128 [2019-09-08 01:18:32,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-08 01:18:32,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-08 01:18:32,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-08 01:18:32,209 INFO L87 Difference]: Start difference. First operand 638 states and 887 transitions. Second operand 128 states. [2019-09-08 01:18:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:36,461 INFO L93 Difference]: Finished difference Result 652 states and 905 transitions. [2019-09-08 01:18:36,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-08 01:18:36,461 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 885 [2019-09-08 01:18:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:36,463 INFO L225 Difference]: With dead ends: 652 [2019-09-08 01:18:36,463 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 01:18:36,463 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:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 01:18:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 643. [2019-09-08 01:18:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 01:18:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 894 transitions. [2019-09-08 01:18:36,470 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 894 transitions. Word has length 885 [2019-09-08 01:18:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:36,470 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 894 transitions. [2019-09-08 01:18:36,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-08 01:18:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 894 transitions. [2019-09-08 01:18:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2019-09-08 01:18:36,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:36,476 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:36,476 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:36,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:36,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1847721935, now seen corresponding path program 126 times [2019-09-08 01:18:36,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:36,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:36,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:42,562 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:42,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:42,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:42,572 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:18:43,141 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2019-09-08 01:18:43,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:43,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 2042 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-08 01:18:43,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:43,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:43,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:43,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2019-09-08 01:18:43,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-08 01:18:43,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-08 01:18:43,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 01:18:43,567 INFO L87 Difference]: Start difference. First operand 643 states and 894 transitions. Second operand 129 states. [2019-09-08 01:18:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:47,639 INFO L93 Difference]: Finished difference Result 657 states and 912 transitions. [2019-09-08 01:18:47,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-08 01:18:47,639 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 892 [2019-09-08 01:18:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:47,641 INFO L225 Difference]: With dead ends: 657 [2019-09-08 01:18:47,641 INFO L226 Difference]: Without dead ends: 652 [2019-09-08 01:18:47,642 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:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-08 01:18:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 648. [2019-09-08 01:18:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-08 01:18:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 901 transitions. [2019-09-08 01:18:47,650 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 901 transitions. Word has length 892 [2019-09-08 01:18:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:47,651 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 901 transitions. [2019-09-08 01:18:47,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-08 01:18:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 901 transitions. [2019-09-08 01:18:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2019-09-08 01:18:47,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:47,657 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:47,657 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash 643866, now seen corresponding path program 127 times [2019-09-08 01:18:47,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:47,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:47,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:47,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:47,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:53,731 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:53,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:53,732 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:53,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:54,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-08 01:18:54,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:54,477 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:54,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:54,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130] total 130 [2019-09-08 01:18:54,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-08 01:18:54,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-08 01:18:54,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-08 01:18:54,484 INFO L87 Difference]: Start difference. First operand 648 states and 901 transitions. Second operand 130 states. [2019-09-08 01:18:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:59,046 INFO L93 Difference]: Finished difference Result 662 states and 919 transitions. [2019-09-08 01:18:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-08 01:18:59,047 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 899 [2019-09-08 01:18:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:59,048 INFO L225 Difference]: With dead ends: 662 [2019-09-08 01:18:59,048 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 01:18:59,049 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:18:59,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 01:18:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 653. [2019-09-08 01:18:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-08 01:18:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 908 transitions. [2019-09-08 01:18:59,057 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 908 transitions. Word has length 899 [2019-09-08 01:18:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:59,058 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 908 transitions. [2019-09-08 01:18:59,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-08 01:18:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 908 transitions. [2019-09-08 01:18:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2019-09-08 01:18:59,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:59,064 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:18:59,064 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1639999471, now seen corresponding path program 128 times [2019-09-08 01:18:59,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:59,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:59,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:59,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:59,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:05,214 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:05,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:05,215 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:05,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:19:05,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:19:05,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:05,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 2074 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-08 01:19:05,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:05,924 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:05,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:05,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2019-09-08 01:19:05,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-08 01:19:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-08 01:19:05,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-08 01:19:05,932 INFO L87 Difference]: Start difference. First operand 653 states and 908 transitions. Second operand 131 states. [2019-09-08 01:19:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:10,276 INFO L93 Difference]: Finished difference Result 667 states and 926 transitions. [2019-09-08 01:19:10,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-08 01:19:10,276 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 906 [2019-09-08 01:19:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:10,277 INFO L225 Difference]: With dead ends: 667 [2019-09-08 01:19:10,277 INFO L226 Difference]: Without dead ends: 662 [2019-09-08 01:19:10,278 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:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-09-08 01:19:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 658. [2019-09-08 01:19:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-08 01:19:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 915 transitions. [2019-09-08 01:19:10,285 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 915 transitions. Word has length 906 [2019-09-08 01:19:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:10,285 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 915 transitions. [2019-09-08 01:19:10,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-08 01:19:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 915 transitions. [2019-09-08 01:19:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2019-09-08 01:19:10,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:10,291 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:10,291 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:10,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:10,291 INFO L82 PathProgramCache]: Analyzing trace with hash 721919802, now seen corresponding path program 129 times [2019-09-08 01:19:10,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:10,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:10,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:10,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:10,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:16,570 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:16,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:16,570 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:16,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:19:17,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 130 check-sat command(s) [2019-09-08 01:19:17,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:17,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 2090 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-08 01:19:17,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:17,571 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:17,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:17,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 132 [2019-09-08 01:19:17,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-08 01:19:17,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-08 01:19:17,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 01:19:17,582 INFO L87 Difference]: Start difference. First operand 658 states and 915 transitions. Second operand 132 states. [2019-09-08 01:19:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:20,177 INFO L93 Difference]: Finished difference Result 672 states and 933 transitions. [2019-09-08 01:19:20,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-08 01:19:20,177 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 913 [2019-09-08 01:19:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:20,178 INFO L225 Difference]: With dead ends: 672 [2019-09-08 01:19:20,178 INFO L226 Difference]: Without dead ends: 667 [2019-09-08 01:19:20,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 914 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 01:19:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-09-08 01:19:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 663. [2019-09-08 01:19:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-08 01:19:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 922 transitions. [2019-09-08 01:19:20,187 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 922 transitions. Word has length 913 [2019-09-08 01:19:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:20,187 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 922 transitions. [2019-09-08 01:19:20,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-08 01:19:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 922 transitions. [2019-09-08 01:19:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2019-09-08 01:19:20,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:20,193 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:20,193 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:20,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:20,193 INFO L82 PathProgramCache]: Analyzing trace with hash -125179919, now seen corresponding path program 130 times [2019-09-08 01:19:20,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:20,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:20,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:26,584 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:26,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:26,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:19:26,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:19:26,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:26,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 2106 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-08 01:19:26,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:27,318 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:27,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:27,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2019-09-08 01:19:27,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-08 01:19:27,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-08 01:19:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-09-08 01:19:27,325 INFO L87 Difference]: Start difference. First operand 663 states and 922 transitions. Second operand 133 states. [2019-09-08 01:19:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:32,126 INFO L93 Difference]: Finished difference Result 677 states and 940 transitions. [2019-09-08 01:19:32,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-08 01:19:32,127 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 920 [2019-09-08 01:19:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:32,128 INFO L225 Difference]: With dead ends: 677 [2019-09-08 01:19:32,128 INFO L226 Difference]: Without dead ends: 672 [2019-09-08 01:19:32,129 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:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-08 01:19:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 668. [2019-09-08 01:19:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-08 01:19:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 929 transitions. [2019-09-08 01:19:32,135 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 929 transitions. Word has length 920 [2019-09-08 01:19:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:32,136 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 929 transitions. [2019-09-08 01:19:32,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-08 01:19:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 929 transitions. [2019-09-08 01:19:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2019-09-08 01:19:32,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:32,141 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:32,141 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash -346180774, now seen corresponding path program 131 times [2019-09-08 01:19:32,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:32,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:32,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:32,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:38,546 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:38,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:38,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38,557 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:19:39,118 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 132 check-sat command(s) [2019-09-08 01:19:39,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:39,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 2122 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-08 01:19:39,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:39,597 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:39,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:39,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 134 [2019-09-08 01:19:39,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-09-08 01:19:39,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-09-08 01:19:39,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-08 01:19:39,606 INFO L87 Difference]: Start difference. First operand 668 states and 929 transitions. Second operand 134 states. [2019-09-08 01:19:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:43,047 INFO L93 Difference]: Finished difference Result 682 states and 947 transitions. [2019-09-08 01:19:43,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-08 01:19:43,047 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 927 [2019-09-08 01:19:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:43,049 INFO L225 Difference]: With dead ends: 682 [2019-09-08 01:19:43,049 INFO L226 Difference]: Without dead ends: 677 [2019-09-08 01:19:43,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 928 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-08 01:19:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-09-08 01:19:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 673. [2019-09-08 01:19:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-09-08 01:19:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 936 transitions. [2019-09-08 01:19:43,056 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 936 transitions. Word has length 927 [2019-09-08 01:19:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:43,057 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 936 transitions. [2019-09-08 01:19:43,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-09-08 01:19:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 936 transitions. [2019-09-08 01:19:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2019-09-08 01:19:43,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:43,063 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:43,063 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:43,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:43,063 INFO L82 PathProgramCache]: Analyzing trace with hash -551882799, now seen corresponding path program 132 times [2019-09-08 01:19:43,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:43,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:43,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:43,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:43,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:49,555 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:49,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:49,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 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:49,566 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:19:50,133 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 133 check-sat command(s) [2019-09-08 01:19:50,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:50,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 2138 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-08 01:19:50,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:50,605 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:50,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:50,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2019-09-08 01:19:50,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-08 01:19:50,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-08 01:19:50,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-08 01:19:50,615 INFO L87 Difference]: Start difference. First operand 673 states and 936 transitions. Second operand 135 states. [2019-09-08 01:19:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:53,447 INFO L93 Difference]: Finished difference Result 687 states and 954 transitions. [2019-09-08 01:19:53,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-08 01:19:53,448 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 934 [2019-09-08 01:19:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:53,449 INFO L225 Difference]: With dead ends: 687 [2019-09-08 01:19:53,449 INFO L226 Difference]: Without dead ends: 682 [2019-09-08 01:19:53,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1068 GetRequests, 935 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-08 01:19:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-08 01:19:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 678. [2019-09-08 01:19:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-09-08 01:19:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 943 transitions. [2019-09-08 01:19:53,457 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 943 transitions. Word has length 934 [2019-09-08 01:19:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:53,458 INFO L475 AbstractCegarLoop]: Abstraction has 678 states and 943 transitions. [2019-09-08 01:19:53,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-08 01:19:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 943 transitions. [2019-09-08 01:19:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2019-09-08 01:19:53,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:53,463 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:53,464 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:53,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1125249158, now seen corresponding path program 133 times [2019-09-08 01:19:53,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:53,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:53,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:53,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:00,019 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:00,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:00,020 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:00,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:20:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:00,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 2154 conjuncts, 135 conjunts are in the unsatisfiable core [2019-09-08 01:20:00,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:00,786 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:00,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:00,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136] total 136 [2019-09-08 01:20:00,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-08 01:20:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-08 01:20:00,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-08 01:20:00,793 INFO L87 Difference]: Start difference. First operand 678 states and 943 transitions. Second operand 136 states. [2019-09-08 01:20:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:03,352 INFO L93 Difference]: Finished difference Result 692 states and 961 transitions. [2019-09-08 01:20:03,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-08 01:20:03,352 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 941 [2019-09-08 01:20:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:03,354 INFO L225 Difference]: With dead ends: 692 [2019-09-08 01:20:03,354 INFO L226 Difference]: Without dead ends: 687 [2019-09-08 01:20:03,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 942 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-08 01:20:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-09-08 01:20:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 683. [2019-09-08 01:20:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-09-08 01:20:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 950 transitions. [2019-09-08 01:20:03,363 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 950 transitions. Word has length 941 [2019-09-08 01:20:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:03,364 INFO L475 AbstractCegarLoop]: Abstraction has 683 states and 950 transitions. [2019-09-08 01:20:03,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-08 01:20:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 950 transitions. [2019-09-08 01:20:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 949 [2019-09-08 01:20:03,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:03,371 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:03,371 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash 332443569, now seen corresponding path program 134 times [2019-09-08 01:20:03,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:03,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:03,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:03,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:20:03,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:10,124 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:10,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:10,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 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:10,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:20:10,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:20:10,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:10,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 2170 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-08 01:20:10,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:10,899 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:10,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:10,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2019-09-08 01:20:10,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-08 01:20:10,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-08 01:20:10,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-08 01:20:10,906 INFO L87 Difference]: Start difference. First operand 683 states and 950 transitions. Second operand 137 states. [2019-09-08 01:20:13,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:13,072 INFO L93 Difference]: Finished difference Result 697 states and 968 transitions. [2019-09-08 01:20:13,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-08 01:20:13,073 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 948 [2019-09-08 01:20:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:13,074 INFO L225 Difference]: With dead ends: 697 [2019-09-08 01:20:13,075 INFO L226 Difference]: Without dead ends: 692 [2019-09-08 01:20:13,075 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:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-09-08 01:20:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 688. [2019-09-08 01:20:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-09-08 01:20:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 957 transitions. [2019-09-08 01:20:13,083 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 957 transitions. Word has length 948 [2019-09-08 01:20:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:13,083 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 957 transitions. [2019-09-08 01:20:13,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-08 01:20:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 957 transitions. [2019-09-08 01:20:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2019-09-08 01:20:13,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:13,090 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:13,090 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:13,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1474645094, now seen corresponding path program 135 times [2019-09-08 01:20:13,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:13,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:13,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:19,982 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:19,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:19,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 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:19,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:20:20,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 136 check-sat command(s) [2019-09-08 01:20:20,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:20,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 2186 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-08 01:20:20,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:21,107 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:21,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:21,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138] total 138 [2019-09-08 01:20:21,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-08 01:20:21,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-08 01:20:21,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 01:20:21,116 INFO L87 Difference]: Start difference. First operand 688 states and 957 transitions. Second operand 138 states. [2019-09-08 01:20:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:24,515 INFO L93 Difference]: Finished difference Result 702 states and 975 transitions. [2019-09-08 01:20:24,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-08 01:20:24,515 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 955 [2019-09-08 01:20:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:24,517 INFO L225 Difference]: With dead ends: 702 [2019-09-08 01:20:24,517 INFO L226 Difference]: Without dead ends: 697 [2019-09-08 01:20:24,517 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:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-08 01:20:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 693. [2019-09-08 01:20:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-09-08 01:20:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 964 transitions. [2019-09-08 01:20:24,524 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 964 transitions. Word has length 955 [2019-09-08 01:20:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:24,525 INFO L475 AbstractCegarLoop]: Abstraction has 693 states and 964 transitions. [2019-09-08 01:20:24,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-08 01:20:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 964 transitions. [2019-09-08 01:20:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2019-09-08 01:20:24,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:24,531 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:24,531 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:24,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:24,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1140250735, now seen corresponding path program 136 times [2019-09-08 01:20:24,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:24,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:24,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:24,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:24,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:31,603 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:31,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:31,604 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:31,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:20:31,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:20:31,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:31,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 2202 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-08 01:20:31,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:32,414 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:32,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:32,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2019-09-08 01:20:32,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-08 01:20:32,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-08 01:20:32,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 01:20:32,423 INFO L87 Difference]: Start difference. First operand 693 states and 964 transitions. Second operand 139 states. [2019-09-08 01:20:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:36,241 INFO L93 Difference]: Finished difference Result 707 states and 982 transitions. [2019-09-08 01:20:36,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-08 01:20:36,242 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 962 [2019-09-08 01:20:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:36,243 INFO L225 Difference]: With dead ends: 707 [2019-09-08 01:20:36,243 INFO L226 Difference]: Without dead ends: 702 [2019-09-08 01:20:36,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1100 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 01:20:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-09-08 01:20:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 698. [2019-09-08 01:20:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-09-08 01:20:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 971 transitions. [2019-09-08 01:20:36,252 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 971 transitions. Word has length 962 [2019-09-08 01:20:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:36,252 INFO L475 AbstractCegarLoop]: Abstraction has 698 states and 971 transitions. [2019-09-08 01:20:36,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-08 01:20:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 971 transitions. [2019-09-08 01:20:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2019-09-08 01:20:36,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:36,259 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:36,259 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:36,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:36,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1640341434, now seen corresponding path program 137 times [2019-09-08 01:20:36,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:36,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:36,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:43,302 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:43,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:43,303 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:43,312 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:20:43,939 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 138 check-sat command(s) [2019-09-08 01:20:43,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:43,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 2218 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-08 01:20:43,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:44,434 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:44,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:44,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 140 [2019-09-08 01:20:44,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-09-08 01:20:44,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-09-08 01:20:44,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-08 01:20:44,443 INFO L87 Difference]: Start difference. First operand 698 states and 971 transitions. Second operand 140 states. [2019-09-08 01:20:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:47,120 INFO L93 Difference]: Finished difference Result 712 states and 989 transitions. [2019-09-08 01:20:47,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-08 01:20:47,121 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 969 [2019-09-08 01:20:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:47,122 INFO L225 Difference]: With dead ends: 712 [2019-09-08 01:20:47,122 INFO L226 Difference]: Without dead ends: 707 [2019-09-08 01:20:47,123 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:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-09-08 01:20:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 703. [2019-09-08 01:20:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-08 01:20:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 978 transitions. [2019-09-08 01:20:47,130 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 978 transitions. Word has length 969 [2019-09-08 01:20:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:47,130 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 978 transitions. [2019-09-08 01:20:47,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-09-08 01:20:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 978 transitions. [2019-09-08 01:20:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2019-09-08 01:20:47,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:47,136 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:47,137 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:47,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:47,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1084381041, now seen corresponding path program 138 times [2019-09-08 01:20:47,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:47,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:47,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:47,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:47,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:54,393 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:20:54,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:54,394 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:20:54,405 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:20:55,023 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2019-09-08 01:20:55,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:55,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 2234 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-08 01:20:55,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:55,520 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:20:55,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:55,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2019-09-08 01:20:55,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-08 01:20:55,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-08 01:20:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-08 01:20:55,530 INFO L87 Difference]: Start difference. First operand 703 states and 978 transitions. Second operand 141 states. [2019-09-08 01:20:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:59,782 INFO L93 Difference]: Finished difference Result 717 states and 996 transitions. [2019-09-08 01:20:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-08 01:20:59,782 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 976 [2019-09-08 01:20:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:59,784 INFO L225 Difference]: With dead ends: 717 [2019-09-08 01:20:59,784 INFO L226 Difference]: Without dead ends: 712 [2019-09-08 01:20:59,784 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:20:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-08 01:20:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 708. [2019-09-08 01:20:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-08 01:20:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 985 transitions. [2019-09-08 01:20:59,791 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 985 transitions. Word has length 976 [2019-09-08 01:20:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:59,792 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 985 transitions. [2019-09-08 01:20:59,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-08 01:20:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 985 transitions. [2019-09-08 01:20:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2019-09-08 01:20:59,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:59,798 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:20:59,798 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:59,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1800459226, now seen corresponding path program 139 times [2019-09-08 01:20:59,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:59,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:59,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:59,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:59,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:07,129 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:07,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:07,129 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:07,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:21:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:07,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 2250 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-08 01:21:07,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:07,922 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:07,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:07,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 142] total 142 [2019-09-08 01:21:07,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-08 01:21:07,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-08 01:21:07,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-08 01:21:07,930 INFO L87 Difference]: Start difference. First operand 708 states and 985 transitions. Second operand 142 states. [2019-09-08 01:21:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:11,974 INFO L93 Difference]: Finished difference Result 722 states and 1003 transitions. [2019-09-08 01:21:11,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-08 01:21:11,974 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 983 [2019-09-08 01:21:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:11,976 INFO L225 Difference]: With dead ends: 722 [2019-09-08 01:21:11,976 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 01:21:11,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1124 GetRequests, 984 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-08 01:21:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 01:21:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2019-09-08 01:21:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-09-08 01:21:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 992 transitions. [2019-09-08 01:21:11,984 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 992 transitions. Word has length 983 [2019-09-08 01:21:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:11,984 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 992 transitions. [2019-09-08 01:21:11,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-08 01:21:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 992 transitions. [2019-09-08 01:21:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2019-09-08 01:21:11,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:11,990 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:11,991 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash 771374929, now seen corresponding path program 140 times [2019-09-08 01:21:11,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:11,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:11,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:21:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:19,372 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:19,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:19,372 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:19,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:21:19,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:21:19,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:19,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 2266 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-08 01:21:19,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:20,180 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:20,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:20,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2019-09-08 01:21:20,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-08 01:21:20,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-08 01:21:20,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-08 01:21:20,187 INFO L87 Difference]: Start difference. First operand 713 states and 992 transitions. Second operand 143 states. [2019-09-08 01:21:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:24,855 INFO L93 Difference]: Finished difference Result 727 states and 1010 transitions. [2019-09-08 01:21:24,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-08 01:21:24,855 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 990 [2019-09-08 01:21:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:24,857 INFO L225 Difference]: With dead ends: 727 [2019-09-08 01:21:24,857 INFO L226 Difference]: Without dead ends: 722 [2019-09-08 01:21:24,858 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:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-09-08 01:21:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 718. [2019-09-08 01:21:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-09-08 01:21:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 999 transitions. [2019-09-08 01:21:24,866 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 999 transitions. Word has length 990 [2019-09-08 01:21:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:24,866 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 999 transitions. [2019-09-08 01:21:24,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-08 01:21:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 999 transitions. [2019-09-08 01:21:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2019-09-08 01:21:24,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:24,873 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:24,873 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash 849235962, now seen corresponding path program 141 times [2019-09-08 01:21:24,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:24,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:24,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:24,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:24,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:32,485 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:32,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:32,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 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:32,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:21:33,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 142 check-sat command(s) [2019-09-08 01:21:33,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:33,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 2282 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-08 01:21:33,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:33,693 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:33,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:33,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 144] total 144 [2019-09-08 01:21:33,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-08 01:21:33,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-08 01:21:33,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-08 01:21:33,701 INFO L87 Difference]: Start difference. First operand 718 states and 999 transitions. Second operand 144 states. [2019-09-08 01:21:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:38,230 INFO L93 Difference]: Finished difference Result 732 states and 1017 transitions. [2019-09-08 01:21:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-08 01:21:38,230 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 997 [2019-09-08 01:21:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:38,232 INFO L225 Difference]: With dead ends: 732 [2019-09-08 01:21:38,232 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 01:21:38,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1140 GetRequests, 998 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-08 01:21:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 01:21:38,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 723. [2019-09-08 01:21:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-09-08 01:21:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1006 transitions. [2019-09-08 01:21:38,243 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1006 transitions. Word has length 997 [2019-09-08 01:21:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:38,243 INFO L475 AbstractCegarLoop]: Abstraction has 723 states and 1006 transitions. [2019-09-08 01:21:38,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-08 01:21:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1006 transitions. [2019-09-08 01:21:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1005 [2019-09-08 01:21:38,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:38,250 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:38,251 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:38,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash 334421809, now seen corresponding path program 142 times [2019-09-08 01:21:38,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:38,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:38,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:38,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:45,873 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:45,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:45,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 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:45,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:21:46,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:21:46,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:46,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 2298 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-08 01:21:46,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:46,708 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:46,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:46,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2019-09-08 01:21:46,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-08 01:21:46,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-08 01:21:46,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-08 01:21:46,715 INFO L87 Difference]: Start difference. First operand 723 states and 1006 transitions. Second operand 145 states. [2019-09-08 01:21:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:51,092 INFO L93 Difference]: Finished difference Result 737 states and 1024 transitions. [2019-09-08 01:21:51,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 01:21:51,093 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 1004 [2019-09-08 01:21:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:51,095 INFO L225 Difference]: With dead ends: 737 [2019-09-08 01:21:51,095 INFO L226 Difference]: Without dead ends: 732 [2019-09-08 01:21:51,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1148 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-08 01:21:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-09-08 01:21:51,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 728. [2019-09-08 01:21:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-09-08 01:21:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1013 transitions. [2019-09-08 01:21:51,104 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1013 transitions. Word has length 1004 [2019-09-08 01:21:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:51,105 INFO L475 AbstractCegarLoop]: Abstraction has 728 states and 1013 transitions. [2019-09-08 01:21:51,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-08 01:21:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1013 transitions. [2019-09-08 01:21:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2019-09-08 01:21:51,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:51,111 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:21:51,112 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:51,112 INFO L82 PathProgramCache]: Analyzing trace with hash 839914522, now seen corresponding path program 143 times [2019-09-08 01:21:51,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:51,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:51,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:51,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:51,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:58,936 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:21:58,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:58,937 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:21:58,947 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:21:59,595 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 144 check-sat command(s) [2019-09-08 01:21:59,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:59,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 2314 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-08 01:21:59,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:00,124 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:00,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:00,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 146 [2019-09-08 01:22:00,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-09-08 01:22:00,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-09-08 01:22:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-08 01:22:00,132 INFO L87 Difference]: Start difference. First operand 728 states and 1013 transitions. Second operand 146 states. [2019-09-08 01:22:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:03,283 INFO L93 Difference]: Finished difference Result 742 states and 1031 transitions. [2019-09-08 01:22:03,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-08 01:22:03,283 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 1011 [2019-09-08 01:22:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:03,285 INFO L225 Difference]: With dead ends: 742 [2019-09-08 01:22:03,285 INFO L226 Difference]: Without dead ends: 737 [2019-09-08 01:22:03,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 1012 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-08 01:22:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-08 01:22:03,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 733. [2019-09-08 01:22:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-09-08 01:22:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1020 transitions. [2019-09-08 01:22:03,293 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1020 transitions. Word has length 1011 [2019-09-08 01:22:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:03,293 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1020 transitions. [2019-09-08 01:22:03,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-09-08 01:22:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1020 transitions. [2019-09-08 01:22:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1019 [2019-09-08 01:22:03,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:03,326 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:03,326 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:03,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1709061905, now seen corresponding path program 144 times [2019-09-08 01:22:03,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:03,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:03,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:03,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:03,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:11,003 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:11,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:11,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 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:11,014 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:22:11,712 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2019-09-08 01:22:11,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:11,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 2330 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-08 01:22:11,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:12,249 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:12,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:12,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2019-09-08 01:22:12,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-08 01:22:12,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-08 01:22:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-08 01:22:12,260 INFO L87 Difference]: Start difference. First operand 733 states and 1020 transitions. Second operand 147 states. [2019-09-08 01:22:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:16,812 INFO L93 Difference]: Finished difference Result 747 states and 1038 transitions. [2019-09-08 01:22:16,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-08 01:22:16,813 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 1018 [2019-09-08 01:22:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:16,814 INFO L225 Difference]: With dead ends: 747 [2019-09-08 01:22:16,814 INFO L226 Difference]: Without dead ends: 742 [2019-09-08 01:22:16,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1164 GetRequests, 1019 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-08 01:22:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-08 01:22:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 738. [2019-09-08 01:22:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-08 01:22:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1027 transitions. [2019-09-08 01:22:16,825 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1027 transitions. Word has length 1018 [2019-09-08 01:22:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:16,826 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1027 transitions. [2019-09-08 01:22:16,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-08 01:22:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1027 transitions. [2019-09-08 01:22:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2019-09-08 01:22:16,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:16,836 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:16,836 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash 277356602, now seen corresponding path program 145 times [2019-09-08 01:22:16,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:16,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:16,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:16,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:16,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:24,811 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:24,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:24,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:22:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:25,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 2346 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-08 01:22:25,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:25,682 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:25,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:25,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 148] total 148 [2019-09-08 01:22:25,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-08 01:22:25,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-08 01:22:25,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-08 01:22:25,690 INFO L87 Difference]: Start difference. First operand 738 states and 1027 transitions. Second operand 148 states. [2019-09-08 01:22:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:30,181 INFO L93 Difference]: Finished difference Result 752 states and 1045 transitions. [2019-09-08 01:22:30,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-08 01:22:30,182 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 1025 [2019-09-08 01:22:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:30,184 INFO L225 Difference]: With dead ends: 752 [2019-09-08 01:22:30,184 INFO L226 Difference]: Without dead ends: 747 [2019-09-08 01:22:30,185 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:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-09-08 01:22:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 743. [2019-09-08 01:22:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-09-08 01:22:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1034 transitions. [2019-09-08 01:22:30,192 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1034 transitions. Word has length 1025 [2019-09-08 01:22:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:30,193 INFO L475 AbstractCegarLoop]: Abstraction has 743 states and 1034 transitions. [2019-09-08 01:22:30,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-08 01:22:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1034 transitions. [2019-09-08 01:22:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2019-09-08 01:22:30,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:30,204 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:30,204 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1520846577, now seen corresponding path program 146 times [2019-09-08 01:22:30,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:30,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:30,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:22:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:38,127 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:38,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:38,128 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:38,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:22:38,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:22:38,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:38,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 2362 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-08 01:22:38,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:39,020 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:39,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:39,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2019-09-08 01:22:39,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-08 01:22:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-08 01:22:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-08 01:22:39,029 INFO L87 Difference]: Start difference. First operand 743 states and 1034 transitions. Second operand 149 states. [2019-09-08 01:22:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:41,839 INFO L93 Difference]: Finished difference Result 757 states and 1052 transitions. [2019-09-08 01:22:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 01:22:41,839 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 1032 [2019-09-08 01:22:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:41,840 INFO L225 Difference]: With dead ends: 757 [2019-09-08 01:22:41,841 INFO L226 Difference]: Without dead ends: 752 [2019-09-08 01:22:41,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 1033 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-08 01:22:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-08 01:22:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 748. [2019-09-08 01:22:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-09-08 01:22:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1041 transitions. [2019-09-08 01:22:41,849 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1041 transitions. Word has length 1032 [2019-09-08 01:22:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:41,849 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1041 transitions. [2019-09-08 01:22:41,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-08 01:22:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1041 transitions. [2019-09-08 01:22:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2019-09-08 01:22:41,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:41,856 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:41,856 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1050119078, now seen corresponding path program 147 times [2019-09-08 01:22:41,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:41,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:41,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:49,901 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:22:49,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:49,902 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:22:49,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:22:50,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 148 check-sat command(s) [2019-09-08 01:22:50,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:50,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 2378 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-08 01:22:50,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:51,267 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:22:51,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:51,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 150] total 150 [2019-09-08 01:22:51,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-08 01:22:51,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-08 01:22:51,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-08 01:22:51,278 INFO L87 Difference]: Start difference. First operand 748 states and 1041 transitions. Second operand 150 states. [2019-09-08 01:22:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:54,316 INFO L93 Difference]: Finished difference Result 762 states and 1059 transitions. [2019-09-08 01:22:54,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-08 01:22:54,316 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 1039 [2019-09-08 01:22:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:54,318 INFO L225 Difference]: With dead ends: 762 [2019-09-08 01:22:54,318 INFO L226 Difference]: Without dead ends: 757 [2019-09-08 01:22:54,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 1040 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-08 01:22:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-09-08 01:22:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 753. [2019-09-08 01:22:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-09-08 01:22:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1048 transitions. [2019-09-08 01:22:54,327 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1048 transitions. Word has length 1039 [2019-09-08 01:22:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:54,328 INFO L475 AbstractCegarLoop]: Abstraction has 753 states and 1048 transitions. [2019-09-08 01:22:54,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-08 01:22:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1048 transitions. [2019-09-08 01:22:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2019-09-08 01:22:54,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:54,336 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:22:54,336 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:54,336 INFO L82 PathProgramCache]: Analyzing trace with hash -861597999, now seen corresponding path program 148 times [2019-09-08 01:22:54,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:54,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:54,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 76294 backedges. 0 proven. 54538 refuted. 0 times theorem prover too weak. 21756 trivial. 0 not checked. [2019-09-08 01:23:02,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:02,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:02,550 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:23:02,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:23:02,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:02,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 2394 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-08 01:23:02,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 76294 backedges. 0 proven. 54538 refuted. 0 times theorem prover too weak. 21756 trivial. 0 not checked. [2019-09-08 01:23:03,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:03,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 151 [2019-09-08 01:23:03,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-08 01:23:03,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-08 01:23:03,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-09-08 01:23:03,550 INFO L87 Difference]: Start difference. First operand 753 states and 1048 transitions. Second operand 151 states. [2019-09-08 01:23:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:06,576 INFO L93 Difference]: Finished difference Result 767 states and 1066 transitions. [2019-09-08 01:23:06,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-08 01:23:06,576 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 1046 [2019-09-08 01:23:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:06,578 INFO L225 Difference]: With dead ends: 767 [2019-09-08 01:23:06,578 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 01:23:06,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1196 GetRequests, 1047 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-09-08 01:23:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 01:23:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 758. [2019-09-08 01:23:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-09-08 01:23:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1055 transitions. [2019-09-08 01:23:06,586 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1055 transitions. Word has length 1046 [2019-09-08 01:23:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:06,587 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 1055 transitions. [2019-09-08 01:23:06,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-08 01:23:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1055 transitions. [2019-09-08 01:23:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1054 [2019-09-08 01:23:06,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:06,595 INFO L399 BasicCegarLoop]: trace histogram [149, 149, 149, 149, 149, 149, 149, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:06,595 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1533865862, now seen corresponding path program 149 times [2019-09-08 01:23:06,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:06,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:06,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:06,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 77331 backedges. 0 proven. 55279 refuted. 0 times theorem prover too weak. 22052 trivial. 0 not checked. [2019-09-08 01:23:14,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:14,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:14,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:23:15,702 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 150 check-sat command(s) [2019-09-08 01:23:15,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:15,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 2410 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-08 01:23:15,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 77331 backedges. 0 proven. 55279 refuted. 0 times theorem prover too weak. 22052 trivial. 0 not checked. [2019-09-08 01:23:16,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:16,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 152] total 152 [2019-09-08 01:23:16,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-09-08 01:23:16,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-09-08 01:23:16,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-08 01:23:16,346 INFO L87 Difference]: Start difference. First operand 758 states and 1055 transitions. Second operand 152 states. [2019-09-08 01:23:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:20,329 INFO L93 Difference]: Finished difference Result 772 states and 1073 transitions. [2019-09-08 01:23:20,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-08 01:23:20,329 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 1053 [2019-09-08 01:23:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:20,330 INFO L225 Difference]: With dead ends: 772 [2019-09-08 01:23:20,330 INFO L226 Difference]: Without dead ends: 767 [2019-09-08 01:23:20,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1054 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-08 01:23:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-09-08 01:23:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 763. [2019-09-08 01:23:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-09-08 01:23:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1062 transitions. [2019-09-08 01:23:20,339 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1062 transitions. Word has length 1053 [2019-09-08 01:23:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:20,340 INFO L475 AbstractCegarLoop]: Abstraction has 763 states and 1062 transitions. [2019-09-08 01:23:20,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-09-08 01:23:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1062 transitions. [2019-09-08 01:23:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2019-09-08 01:23:20,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:20,347 INFO L399 BasicCegarLoop]: trace histogram [150, 150, 150, 150, 150, 150, 150, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:20,347 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:20,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash 431525553, now seen corresponding path program 150 times [2019-09-08 01:23:20,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:20,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:20,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:20,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:20,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat