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/rlim_exit.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:13:49,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:13:49,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:13:49,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:13:49,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:13:49,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:13:49,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:13:49,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:13:49,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:13:49,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:13:49,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:13:49,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:13:49,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:13:49,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:13:49,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:13:49,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:13:49,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:13:49,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:13:49,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:13:49,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:13:49,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:13:49,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:13:49,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:13:49,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:13:49,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:13:49,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:13:49,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:13:49,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:13:49,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:13:49,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:13:49,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:13:49,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:13:49,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:13:49,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:13:49,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:13:49,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:13:49,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:13:49,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:13:49,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:13:49,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:13:49,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:13:49,432 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:13:49,447 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:13:49,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:13:49,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:13:49,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:13:49,449 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:13:49,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:13:49,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:13:49,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:13:49,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:13:49,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:13:49,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:13:49,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:13:49,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:13:49,451 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:13:49,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:13:49,451 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:13:49,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:13:49,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:13:49,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:13:49,452 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:13:49,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:13:49,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:13:49,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:13:49,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:13:49,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:13:49,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:13:49,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:13:49,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:13:49,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:13:49,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:13:49,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:13:49,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:13:49,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:13:49,501 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:13:49,502 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/rlim_exit.c [2019-09-08 01:13:49,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f303be355/b7dfb1b8b5f84b2193e80cb40ffa582a/FLAGcc8009eab [2019-09-08 01:13:49,991 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:13:49,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/rlim_exit.c [2019-09-08 01:13:49,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f303be355/b7dfb1b8b5f84b2193e80cb40ffa582a/FLAGcc8009eab [2019-09-08 01:13:50,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f303be355/b7dfb1b8b5f84b2193e80cb40ffa582a [2019-09-08 01:13:50,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:13:50,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:13:50,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:13:50,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:13:50,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:13:50,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:13:50" (1/1) ... [2019-09-08 01:13:50,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4967aa79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50, skipping insertion in model container [2019-09-08 01:13:50,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:13:50" (1/1) ... [2019-09-08 01:13:50,380 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:13:50,402 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:13:50,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:13:50,654 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:13:50,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:13:50,698 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:13:50,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50 WrapperNode [2019-09-08 01:13:50,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:13:50,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:13:50,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:13:50,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:13:50,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50" (1/1) ... [2019-09-08 01:13:50,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50" (1/1) ... [2019-09-08 01:13:50,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50" (1/1) ... [2019-09-08 01:13:50,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50" (1/1) ... [2019-09-08 01:13:50,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50" (1/1) ... [2019-09-08 01:13:50,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50" (1/1) ... [2019-09-08 01:13:50,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50" (1/1) ... [2019-09-08 01:13:50,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:13:50,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:13:50,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:13:50,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:13:50,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50" (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:13:50,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:13:50,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:13:50,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 01:13:50,924 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:13:50,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:13:50,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2019-09-08 01:13:50,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 01:13:50,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 01:13:50,925 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:13:50,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:13:50,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:13:51,142 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:13:51,142 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 01:13:51,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:13:51 BoogieIcfgContainer [2019-09-08 01:13:51,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:13:51,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:13:51,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:13:51,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:13:51,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:13:50" (1/3) ... [2019-09-08 01:13:51,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154a18a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:13:51, skipping insertion in model container [2019-09-08 01:13:51,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:13:50" (2/3) ... [2019-09-08 01:13:51,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154a18a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:13:51, skipping insertion in model container [2019-09-08 01:13:51,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:13:51" (3/3) ... [2019-09-08 01:13:51,167 INFO L109 eAbstractionObserver]: Analyzing ICFG rlim_exit.c [2019-09-08 01:13:51,190 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:13:51,199 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:13:51,242 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:13:51,281 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:13:51,281 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:13:51,282 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:13:51,282 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:13:51,282 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:13:51,282 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:13:51,282 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:13:51,282 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:13:51,283 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:13:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-08 01:13:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:13:51,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:51,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:51,307 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:51,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1001202113, now seen corresponding path program 1 times [2019-09-08 01:13:51,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:51,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:51,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:51,417 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:13:51,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:13:51,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:13:51,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:13:51,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:13:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:13:51,437 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-09-08 01:13:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:51,458 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-09-08 01:13:51,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:13:51,460 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-08 01:13:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:51,468 INFO L225 Difference]: With dead ends: 33 [2019-09-08 01:13:51,468 INFO L226 Difference]: Without dead ends: 14 [2019-09-08 01:13:51,472 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:13:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-08 01:13:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-08 01:13:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-08 01:13:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-09-08 01:13:51,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2019-09-08 01:13:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:51,510 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-09-08 01:13:51,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:13:51,511 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-09-08 01:13:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:13:51,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:51,511 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:51,512 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:51,512 INFO L82 PathProgramCache]: Analyzing trace with hash 986425777, now seen corresponding path program 1 times [2019-09-08 01:13:51,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:51,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:51,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:51,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:51,553 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:13:51,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:13:51,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:13:51,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:13:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:13:51,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:13:51,557 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states. [2019-09-08 01:13:51,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:51,584 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-08 01:13:51,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:13:51,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-08 01:13:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:51,586 INFO L225 Difference]: With dead ends: 23 [2019-09-08 01:13:51,586 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 01:13:51,587 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:13:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 01:13:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-09-08 01:13:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-08 01:13:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-08 01:13:51,592 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-09-08 01:13:51,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:51,593 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-08 01:13:51,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:13:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-08 01:13:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 01:13:51,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:51,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:51,594 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:51,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:51,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1964653940, now seen corresponding path program 1 times [2019-09-08 01:13:51,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:51,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:51,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:51,635 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:13:51,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:51,636 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:13:51,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:51,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:13:51,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:51,706 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:13:51,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:51,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-08 01:13:51,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:13:51,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:13:51,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:13:51,724 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 4 states. [2019-09-08 01:13:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:51,764 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-09-08 01:13:51,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:13:51,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-08 01:13:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:51,766 INFO L225 Difference]: With dead ends: 27 [2019-09-08 01:13:51,766 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:13:51,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:13:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:13:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-09-08 01:13:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 01:13:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-09-08 01:13:51,772 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2019-09-08 01:13:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:51,773 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-09-08 01:13:51,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:13:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-09-08 01:13:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 01:13:51,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:51,774 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:51,775 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:51,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1288212783, now seen corresponding path program 2 times [2019-09-08 01:13:51,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:51,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:51,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:51,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:51,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:51,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:13:51,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:51,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:13:51,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:51,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:13:51,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:51,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:51,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-08 01:13:51,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:13:51,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:13:51,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:13:51,936 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 5 states. [2019-09-08 01:13:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:51,975 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-09-08 01:13:51,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:13:51,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-08 01:13:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:51,978 INFO L225 Difference]: With dead ends: 31 [2019-09-08 01:13:51,979 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 01:13:51,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:13:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 01:13:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-08 01:13:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:13:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-09-08 01:13:51,994 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 16 [2019-09-08 01:13:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:51,994 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-09-08 01:13:51,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:13:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2019-09-08 01:13:51,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 01:13:51,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:51,997 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:51,997 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:51,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:51,998 INFO L82 PathProgramCache]: Analyzing trace with hash -93658028, now seen corresponding path program 3 times [2019-09-08 01:13:51,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:51,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:51,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:51,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:51,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:52,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:52,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:13:52,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:52,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 01:13:52,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:52,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:13:52,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:52,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:52,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 01:13:52,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:13:52,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:13:52,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:13:52,178 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 6 states. [2019-09-08 01:13:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:52,222 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-09-08 01:13:52,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:13:52,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-08 01:13:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:52,226 INFO L225 Difference]: With dead ends: 35 [2019-09-08 01:13:52,227 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 01:13:52,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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:13:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 01:13:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-09-08 01:13:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 01:13:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-09-08 01:13:52,234 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 19 [2019-09-08 01:13:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:52,235 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-09-08 01:13:52,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:13:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-09-08 01:13:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 01:13:52,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:52,236 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:52,236 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:52,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:52,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1211966479, now seen corresponding path program 4 times [2019-09-08 01:13:52,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:52,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:52,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:52,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:52,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:52,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:52,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:52,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:13:52,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:13:52,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:52,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:13:52,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:52,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:52,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 01:13:52,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:13:52,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:13:52,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:13:52,391 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2019-09-08 01:13:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:52,428 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-09-08 01:13:52,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:13:52,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-08 01:13:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:52,430 INFO L225 Difference]: With dead ends: 39 [2019-09-08 01:13:52,430 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 01:13:52,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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:13:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 01:13:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-09-08 01:13:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 01:13:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-09-08 01:13:52,437 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 22 [2019-09-08 01:13:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:52,437 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-09-08 01:13:52,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:13:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-09-08 01:13:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 01:13:52,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:52,440 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:52,440 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:52,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:52,441 INFO L82 PathProgramCache]: Analyzing trace with hash -677715148, now seen corresponding path program 5 times [2019-09-08 01:13:52,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:52,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:52,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:52,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:52,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:52,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:52,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:52,580 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:13:52,612 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 01:13:52,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:52,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 01:13:52,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:52,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:52,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-08 01:13:52,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:13:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:13:52,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:13:52,636 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 8 states. [2019-09-08 01:13:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:52,682 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-09-08 01:13:52,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:13:52,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-09-08 01:13:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:52,683 INFO L225 Difference]: With dead ends: 43 [2019-09-08 01:13:52,683 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 01:13:52,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 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:13:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 01:13:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-09-08 01:13:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 01:13:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2019-09-08 01:13:52,690 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 25 [2019-09-08 01:13:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:52,691 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-09-08 01:13:52,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:13:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2019-09-08 01:13:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:13:52,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:52,692 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:52,692 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:52,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1945112303, now seen corresponding path program 6 times [2019-09-08 01:13:52,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:52,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:52,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:52,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:52,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:52,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:52,800 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:13:52,818 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:13:52,848 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 01:13:52,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:52,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:13:52,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:52,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:52,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 01:13:52,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:13:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:13:52,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:13:52,874 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand 9 states. [2019-09-08 01:13:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:52,927 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-09-08 01:13:52,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:13:52,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-09-08 01:13:52,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:52,929 INFO L225 Difference]: With dead ends: 47 [2019-09-08 01:13:52,929 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 01:13:52,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 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:13:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 01:13:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-09-08 01:13:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 01:13:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-09-08 01:13:52,936 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 28 [2019-09-08 01:13:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:52,936 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-09-08 01:13:52,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:13:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2019-09-08 01:13:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 01:13:52,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:52,937 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:52,938 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1916257772, now seen corresponding path program 7 times [2019-09-08 01:13:52,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:52,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:52,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:53,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:53,087 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:13:53,106 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:13:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:53,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:13:53,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:53,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:53,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-08 01:13:53,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:13:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:13:53,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:13:53,162 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand 10 states. [2019-09-08 01:13:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:53,217 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2019-09-08 01:13:53,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:13:53,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-09-08 01:13:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:53,220 INFO L225 Difference]: With dead ends: 51 [2019-09-08 01:13:53,220 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 01:13:53,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 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:13:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 01:13:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-09-08 01:13:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 01:13:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2019-09-08 01:13:53,233 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 31 [2019-09-08 01:13:53,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:53,234 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2019-09-08 01:13:53,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:13:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2019-09-08 01:13:53,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 01:13:53,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:53,237 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:53,238 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:53,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:53,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1304383951, now seen corresponding path program 8 times [2019-09-08 01:13:53,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:53,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:53,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:53,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:53,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:53,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:53,389 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:13:53,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:13:53,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:13:53,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:53,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:13:53,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:53,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:53,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 01:13:53,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:13:53,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:13:53,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:13:53,470 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand 11 states. [2019-09-08 01:13:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:53,523 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2019-09-08 01:13:53,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:13:53,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-09-08 01:13:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:53,528 INFO L225 Difference]: With dead ends: 55 [2019-09-08 01:13:53,529 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 01:13:53,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 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:13:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 01:13:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-08 01:13:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 01:13:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2019-09-08 01:13:53,540 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 34 [2019-09-08 01:13:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:53,541 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2019-09-08 01:13:53,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:13:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2019-09-08 01:13:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 01:13:53,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:53,543 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:53,543 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash -812586764, now seen corresponding path program 9 times [2019-09-08 01:13:53,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:53,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:53,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:53,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:53,727 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:13:53,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:13:53,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 01:13:53,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:53,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:13:53,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:13:53,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:53,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-08 01:13:53,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:13:53,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:13:53,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:13:53,832 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand 12 states. [2019-09-08 01:13:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:53,884 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2019-09-08 01:13:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:13:53,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-09-08 01:13:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:53,886 INFO L225 Difference]: With dead ends: 59 [2019-09-08 01:13:53,886 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 01:13:53,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 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:13:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 01:13:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-09-08 01:13:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 01:13:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2019-09-08 01:13:53,892 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 37 [2019-09-08 01:13:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:53,893 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2019-09-08 01:13:53,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:13:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2019-09-08 01:13:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:13:53,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:53,894 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:53,894 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:53,895 INFO L82 PathProgramCache]: Analyzing trace with hash 183964497, now seen corresponding path program 10 times [2019-09-08 01:13:53,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:53,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:53,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:54,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:54,031 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:13:54,053 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:13:54,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:13:54,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:54,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 01:13:54,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:54,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:54,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-08 01:13:54,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:13:54,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:13:54,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:13:54,114 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 13 states. [2019-09-08 01:13:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:54,186 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2019-09-08 01:13:54,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:13:54,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-08 01:13:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:54,188 INFO L225 Difference]: With dead ends: 63 [2019-09-08 01:13:54,188 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 01:13:54,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:13:54,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 01:13:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-09-08 01:13:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 01:13:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2019-09-08 01:13:54,200 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 40 [2019-09-08 01:13:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:54,200 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2019-09-08 01:13:54,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:13:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2019-09-08 01:13:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 01:13:54,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:54,203 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:54,203 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1628630996, now seen corresponding path program 11 times [2019-09-08 01:13:54,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:54,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:54,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:54,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:54,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:54,357 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:13:54,371 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:13:54,420 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 01:13:54,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:54,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:13:54,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:13:54,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:54,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-08 01:13:54,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:13:54,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:13:54,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:13:54,449 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 14 states. [2019-09-08 01:13:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:54,505 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2019-09-08 01:13:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 01:13:54,506 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-09-08 01:13:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:54,507 INFO L225 Difference]: With dead ends: 67 [2019-09-08 01:13:54,507 INFO L226 Difference]: Without dead ends: 62 [2019-09-08 01:13:54,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 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:13:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-08 01:13:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-09-08 01:13:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 01:13:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2019-09-08 01:13:54,513 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 43 [2019-09-08 01:13:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:54,514 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2019-09-08 01:13:54,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:13:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2019-09-08 01:13:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 01:13:54,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:54,515 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:54,515 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash -178970511, now seen corresponding path program 12 times [2019-09-08 01:13:54,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:54,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:54,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:54,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:54,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:54,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:54,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:54,724 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:13:54,783 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 01:13:54,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:54,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 01:13:54,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:54,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:54,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-08 01:13:54,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 01:13:54,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 01:13:54,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:13:54,813 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand 15 states. [2019-09-08 01:13:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:54,864 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2019-09-08 01:13:54,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 01:13:54,864 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2019-09-08 01:13:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:54,865 INFO L225 Difference]: With dead ends: 71 [2019-09-08 01:13:54,865 INFO L226 Difference]: Without dead ends: 66 [2019-09-08 01:13:54,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 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:13:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-08 01:13:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-09-08 01:13:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 01:13:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2019-09-08 01:13:54,871 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 46 [2019-09-08 01:13:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:54,872 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2019-09-08 01:13:54,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 01:13:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2019-09-08 01:13:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 01:13:54,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:54,873 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:54,873 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash -135508300, now seen corresponding path program 13 times [2019-09-08 01:13:54,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:54,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:54,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:55,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:55,040 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:13:55,058 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:13:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:55,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 01:13:55,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:55,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:55,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-08 01:13:55,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 01:13:55,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 01:13:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:13:55,133 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand 16 states. [2019-09-08 01:13:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:55,181 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2019-09-08 01:13:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 01:13:55,182 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-09-08 01:13:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:55,183 INFO L225 Difference]: With dead ends: 75 [2019-09-08 01:13:55,183 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 01:13:55,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 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:13:55,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 01:13:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-09-08 01:13:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-08 01:13:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2019-09-08 01:13:55,188 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 49 [2019-09-08 01:13:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:55,189 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2019-09-08 01:13:55,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 01:13:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2019-09-08 01:13:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 01:13:55,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:55,190 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:55,190 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1862063505, now seen corresponding path program 14 times [2019-09-08 01:13:55,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:55,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:55,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:55,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:55,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:13:55,402 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:13:55,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:13:55,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:55,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 01:13:55,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:55,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:55,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-08 01:13:55,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 01:13:55,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 01:13:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:13:55,482 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand 17 states. [2019-09-08 01:13:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:55,583 INFO L93 Difference]: Finished difference Result 79 states and 111 transitions. [2019-09-08 01:13:55,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 01:13:55,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2019-09-08 01:13:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:55,584 INFO L225 Difference]: With dead ends: 79 [2019-09-08 01:13:55,584 INFO L226 Difference]: Without dead ends: 74 [2019-09-08 01:13:55,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 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:13:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-08 01:13:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-09-08 01:13:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-08 01:13:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2019-09-08 01:13:55,602 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 52 [2019-09-08 01:13:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:55,602 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-09-08 01:13:55,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 01:13:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2019-09-08 01:13:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 01:13:55,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:55,604 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:55,608 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash 456852884, now seen corresponding path program 15 times [2019-09-08 01:13:55,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:55,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:55,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:55,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:55,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:55,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:55,831 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:13:55,854 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:13:55,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-08 01:13:55,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:55,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 01:13:55,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:55,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:55,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-08 01:13:55,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 01:13:55,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 01:13:55,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:13:55,939 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand 18 states. [2019-09-08 01:13:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:56,002 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2019-09-08 01:13:56,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 01:13:56,002 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-09-08 01:13:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:56,003 INFO L225 Difference]: With dead ends: 83 [2019-09-08 01:13:56,004 INFO L226 Difference]: Without dead ends: 78 [2019-09-08 01:13:56,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 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:13:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-08 01:13:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-09-08 01:13:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 01:13:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2019-09-08 01:13:56,009 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 55 [2019-09-08 01:13:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:56,010 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2019-09-08 01:13:56,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 01:13:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2019-09-08 01:13:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 01:13:56,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:56,011 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:56,011 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:56,012 INFO L82 PathProgramCache]: Analyzing trace with hash 873476785, now seen corresponding path program 16 times [2019-09-08 01:13:56,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:56,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:56,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:56,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:56,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:56,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:56,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:13:56,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:56,262 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:13:56,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:56,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 01:13:56,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:56,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:56,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-08 01:13:56,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 01:13:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 01:13:56,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:13:56,284 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand 19 states. [2019-09-08 01:13:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:56,360 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2019-09-08 01:13:56,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 01:13:56,361 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-09-08 01:13:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:56,362 INFO L225 Difference]: With dead ends: 87 [2019-09-08 01:13:56,362 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 01:13:56,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 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:13:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 01:13:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-09-08 01:13:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 01:13:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2019-09-08 01:13:56,376 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 58 [2019-09-08 01:13:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:56,378 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2019-09-08 01:13:56,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 01:13:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2019-09-08 01:13:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 01:13:56,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:56,379 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:56,379 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:56,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:56,380 INFO L82 PathProgramCache]: Analyzing trace with hash 60626036, now seen corresponding path program 17 times [2019-09-08 01:13:56,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:56,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:56,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:56,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:56,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:56,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:56,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:13:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:56,719 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-08 01:13:56,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:56,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 01:13:56,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:56,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:56,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-08 01:13:56,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 01:13:56,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 01:13:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:13:56,756 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand 20 states. [2019-09-08 01:13:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:56,819 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2019-09-08 01:13:56,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:13:56,819 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2019-09-08 01:13:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:56,820 INFO L225 Difference]: With dead ends: 91 [2019-09-08 01:13:56,820 INFO L226 Difference]: Without dead ends: 86 [2019-09-08 01:13:56,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 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:13:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-08 01:13:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2019-09-08 01:13:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-08 01:13:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2019-09-08 01:13:56,825 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 61 [2019-09-08 01:13:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:56,825 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2019-09-08 01:13:56,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 01:13:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2019-09-08 01:13:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 01:13:56,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:56,826 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:56,827 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash -550422575, now seen corresponding path program 18 times [2019-09-08 01:13:56,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:56,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:56,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:57,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:57,059 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:13:57,080 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:13:57,157 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 01:13:57,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:57,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 01:13:57,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:57,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:57,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-08 01:13:57,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 01:13:57,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 01:13:57,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:13:57,183 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand 21 states. [2019-09-08 01:13:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:57,302 INFO L93 Difference]: Finished difference Result 95 states and 135 transitions. [2019-09-08 01:13:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:13:57,303 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-09-08 01:13:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:57,304 INFO L225 Difference]: With dead ends: 95 [2019-09-08 01:13:57,304 INFO L226 Difference]: Without dead ends: 90 [2019-09-08 01:13:57,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:13:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-08 01:13:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-09-08 01:13:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-08 01:13:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2019-09-08 01:13:57,309 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 64 [2019-09-08 01:13:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:57,309 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2019-09-08 01:13:57,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 01:13:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2019-09-08 01:13:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 01:13:57,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:57,310 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:57,311 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:57,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:57,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2066774868, now seen corresponding path program 19 times [2019-09-08 01:13:57,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:57,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:57,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:57,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:57,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:57,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:57,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:13:57,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:57,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 01:13:57,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:57,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:57,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-08 01:13:57,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 01:13:57,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 01:13:57,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:13:57,656 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand 22 states. [2019-09-08 01:13:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:57,732 INFO L93 Difference]: Finished difference Result 99 states and 141 transitions. [2019-09-08 01:13:57,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 01:13:57,733 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-09-08 01:13:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:57,734 INFO L225 Difference]: With dead ends: 99 [2019-09-08 01:13:57,734 INFO L226 Difference]: Without dead ends: 94 [2019-09-08 01:13:57,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 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:13:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-08 01:13:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-09-08 01:13:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-08 01:13:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2019-09-08 01:13:57,739 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 67 [2019-09-08 01:13:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:57,739 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2019-09-08 01:13:57,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 01:13:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2019-09-08 01:13:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 01:13:57,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:57,740 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:57,741 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:57,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash 159507697, now seen corresponding path program 20 times [2019-09-08 01:13:57,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:57,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:57,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:13:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:57,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:57,997 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:13:58,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:13:58,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:13:58,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:58,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 01:13:58,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:13:58,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:58,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-08 01:13:58,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 01:13:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 01:13:58,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:13:58,091 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand 23 states. [2019-09-08 01:13:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:58,165 INFO L93 Difference]: Finished difference Result 103 states and 147 transitions. [2019-09-08 01:13:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 01:13:58,168 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2019-09-08 01:13:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:58,170 INFO L225 Difference]: With dead ends: 103 [2019-09-08 01:13:58,170 INFO L226 Difference]: Without dead ends: 98 [2019-09-08 01:13:58,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 71 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:13:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-08 01:13:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2019-09-08 01:13:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-08 01:13:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2019-09-08 01:13:58,175 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 70 [2019-09-08 01:13:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:58,176 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2019-09-08 01:13:58,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 01:13:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2019-09-08 01:13:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 01:13:58,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:58,177 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:58,177 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:58,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1114424780, now seen corresponding path program 21 times [2019-09-08 01:13:58,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:58,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:58,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:58,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:58,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:58,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:58,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:13:58,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:58,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-08 01:13:58,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:58,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 01:13:58,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:58,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:58,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-08 01:13:58,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 01:13:58,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 01:13:58,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:13:58,579 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand 24 states. [2019-09-08 01:13:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:58,650 INFO L93 Difference]: Finished difference Result 107 states and 153 transitions. [2019-09-08 01:13:58,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 01:13:58,651 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2019-09-08 01:13:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:58,652 INFO L225 Difference]: With dead ends: 107 [2019-09-08 01:13:58,652 INFO L226 Difference]: Without dead ends: 102 [2019-09-08 01:13:58,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 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:13:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-08 01:13:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2019-09-08 01:13:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-08 01:13:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2019-09-08 01:13:58,657 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 73 [2019-09-08 01:13:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:58,658 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2019-09-08 01:13:58,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 01:13:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2019-09-08 01:13:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 01:13:58,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:58,659 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:58,659 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:58,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:58,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1789147665, now seen corresponding path program 22 times [2019-09-08 01:13:58,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:58,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:58,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:58,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:58,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:58,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:58,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:13:58,998 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:59,050 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:13:59,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:59,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 01:13:59,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:59,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:59,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-08 01:13:59,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 01:13:59,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 01:13:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 01:13:59,082 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand 25 states. [2019-09-08 01:13:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:59,179 INFO L93 Difference]: Finished difference Result 111 states and 159 transitions. [2019-09-08 01:13:59,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 01:13:59,179 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2019-09-08 01:13:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:59,180 INFO L225 Difference]: With dead ends: 111 [2019-09-08 01:13:59,180 INFO L226 Difference]: Without dead ends: 106 [2019-09-08 01:13:59,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 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:13:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-08 01:13:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2019-09-08 01:13:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-08 01:13:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2019-09-08 01:13:59,187 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 76 [2019-09-08 01:13:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:59,187 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2019-09-08 01:13:59,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 01:13:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2019-09-08 01:13:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 01:13:59,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:59,188 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:59,188 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:59,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1474515220, now seen corresponding path program 23 times [2019-09-08 01:13:59,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:59,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:59,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:59,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:59,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:13:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:59,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:13:59,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:13:59,579 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:13:59,668 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-08 01:13:59,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:13:59,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 01:13:59,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:13:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:13:59,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:13:59,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-08 01:13:59,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 01:13:59,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 01:13:59,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:13:59,694 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand 26 states. [2019-09-08 01:13:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:13:59,801 INFO L93 Difference]: Finished difference Result 115 states and 165 transitions. [2019-09-08 01:13:59,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 01:13:59,801 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2019-09-08 01:13:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:13:59,802 INFO L225 Difference]: With dead ends: 115 [2019-09-08 01:13:59,802 INFO L226 Difference]: Without dead ends: 110 [2019-09-08 01:13:59,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:13:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-08 01:13:59,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-09-08 01:13:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-08 01:13:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2019-09-08 01:13:59,806 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 79 [2019-09-08 01:13:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:13:59,807 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2019-09-08 01:13:59,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 01:13:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2019-09-08 01:13:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 01:13:59,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:13:59,808 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:13:59,808 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:13:59,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:13:59,809 INFO L82 PathProgramCache]: Analyzing trace with hash -122013903, now seen corresponding path program 24 times [2019-09-08 01:13:59,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:13:59,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:13:59,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:59,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:13:59,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:13:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:00,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:00,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:14:00,253 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:00,340 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-08 01:14:00,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:00,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 01:14:00,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:00,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:00,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-08 01:14:00,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 01:14:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 01:14:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:14:00,364 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand 27 states. [2019-09-08 01:14:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:00,457 INFO L93 Difference]: Finished difference Result 119 states and 171 transitions. [2019-09-08 01:14:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 01:14:00,458 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2019-09-08 01:14:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:00,459 INFO L225 Difference]: With dead ends: 119 [2019-09-08 01:14:00,460 INFO L226 Difference]: Without dead ends: 114 [2019-09-08 01:14:00,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 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:14:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-08 01:14:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-09-08 01:14:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-08 01:14:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2019-09-08 01:14:00,465 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 82 [2019-09-08 01:14:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:00,466 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2019-09-08 01:14:00,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 01:14:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2019-09-08 01:14:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 01:14:00,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:00,467 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:00,467 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:00,468 INFO L82 PathProgramCache]: Analyzing trace with hash 146718708, now seen corresponding path program 25 times [2019-09-08 01:14:00,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:00,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:00,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:00,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:00,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:00,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:00,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:14:00,863 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:14:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:00,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 01:14:00,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:00,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:00,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-08 01:14:00,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 01:14:00,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 01:14:00,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:14:00,960 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand 28 states. [2019-09-08 01:14:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:01,091 INFO L93 Difference]: Finished difference Result 123 states and 177 transitions. [2019-09-08 01:14:01,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 01:14:01,092 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2019-09-08 01:14:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:01,093 INFO L225 Difference]: With dead ends: 123 [2019-09-08 01:14:01,093 INFO L226 Difference]: Without dead ends: 118 [2019-09-08 01:14:01,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 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:14:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-08 01:14:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2019-09-08 01:14:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-08 01:14:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2019-09-08 01:14:01,101 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 85 [2019-09-08 01:14:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:01,102 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2019-09-08 01:14:01,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 01:14:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2019-09-08 01:14:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 01:14:01,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:01,103 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:01,104 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:01,104 INFO L82 PathProgramCache]: Analyzing trace with hash 140893265, now seen corresponding path program 26 times [2019-09-08 01:14:01,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:01,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:01,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:01,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:01,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:01,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:01,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:01,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:01,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:01,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:01,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 01:14:01,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:01,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:01,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-08 01:14:01,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 01:14:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 01:14:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:14:01,715 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand 29 states. [2019-09-08 01:14:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:01,846 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2019-09-08 01:14:01,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 01:14:01,847 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2019-09-08 01:14:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:01,848 INFO L225 Difference]: With dead ends: 127 [2019-09-08 01:14:01,848 INFO L226 Difference]: Without dead ends: 122 [2019-09-08 01:14:01,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 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:14:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-08 01:14:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2019-09-08 01:14:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-08 01:14:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2019-09-08 01:14:01,854 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 88 [2019-09-08 01:14:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:01,854 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2019-09-08 01:14:01,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 01:14:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2019-09-08 01:14:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 01:14:01,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:01,855 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:01,856 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:01,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1606187308, now seen corresponding path program 27 times [2019-09-08 01:14:01,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:01,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:01,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:01,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:01,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:02,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:02,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:14:02,518 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:14:02,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-08 01:14:02,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:02,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 01:14:02,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:02,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:02,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-08 01:14:02,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 01:14:02,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 01:14:02,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:14:02,658 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand 30 states. [2019-09-08 01:14:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:02,780 INFO L93 Difference]: Finished difference Result 131 states and 189 transitions. [2019-09-08 01:14:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 01:14:02,781 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2019-09-08 01:14:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:02,782 INFO L225 Difference]: With dead ends: 131 [2019-09-08 01:14:02,782 INFO L226 Difference]: Without dead ends: 126 [2019-09-08 01:14:02,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:14:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-08 01:14:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2019-09-08 01:14:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-08 01:14:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2019-09-08 01:14:02,800 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 91 [2019-09-08 01:14:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:02,800 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2019-09-08 01:14:02,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 01:14:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2019-09-08 01:14:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 01:14:02,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:02,801 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:02,802 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:02,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1825122673, now seen corresponding path program 28 times [2019-09-08 01:14:02,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:02,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:02,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:02,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:02,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:03,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:03,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:14:03,263 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:14:03,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:14:03,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:03,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 01:14:03,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:03,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-08 01:14:03,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 01:14:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 01:14:03,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 01:14:03,366 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand 31 states. [2019-09-08 01:14:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:03,473 INFO L93 Difference]: Finished difference Result 135 states and 195 transitions. [2019-09-08 01:14:03,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 01:14:03,474 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2019-09-08 01:14:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:03,475 INFO L225 Difference]: With dead ends: 135 [2019-09-08 01:14:03,476 INFO L226 Difference]: Without dead ends: 130 [2019-09-08 01:14:03,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 95 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:14:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-08 01:14:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-09-08 01:14:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-08 01:14:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2019-09-08 01:14:03,482 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 94 [2019-09-08 01:14:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:03,483 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2019-09-08 01:14:03,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 01:14:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2019-09-08 01:14:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 01:14:03,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:03,484 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:03,485 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash -535845452, now seen corresponding path program 29 times [2019-09-08 01:14:03,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:03,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:03,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:03,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:03,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:03,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:03,917 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:14:03,933 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:14:04,046 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-08 01:14:04,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:04,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 01:14:04,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:04,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:04,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-08 01:14:04,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 01:14:04,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 01:14:04,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:14:04,104 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand 32 states. [2019-09-08 01:14:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:04,217 INFO L93 Difference]: Finished difference Result 139 states and 201 transitions. [2019-09-08 01:14:04,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 01:14:04,217 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2019-09-08 01:14:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:04,219 INFO L225 Difference]: With dead ends: 139 [2019-09-08 01:14:04,219 INFO L226 Difference]: Without dead ends: 134 [2019-09-08 01:14:04,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:14:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-08 01:14:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-09-08 01:14:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-08 01:14:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 191 transitions. [2019-09-08 01:14:04,224 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 191 transitions. Word has length 97 [2019-09-08 01:14:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:04,224 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 191 transitions. [2019-09-08 01:14:04,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 01:14:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 191 transitions. [2019-09-08 01:14:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 01:14:04,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:04,225 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:04,226 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1752818031, now seen corresponding path program 30 times [2019-09-08 01:14:04,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:04,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:04,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:04,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:04,721 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) [2019-09-08 01:14:04,743 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:04,846 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-08 01:14:04,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:04,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 01:14:04,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 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:14:04,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:04,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-08 01:14:04,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 01:14:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 01:14:04,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:14:04,875 INFO L87 Difference]: Start difference. First operand 131 states and 191 transitions. Second operand 33 states. [2019-09-08 01:14:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:04,999 INFO L93 Difference]: Finished difference Result 143 states and 207 transitions. [2019-09-08 01:14:04,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 01:14:04,999 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2019-09-08 01:14:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:05,000 INFO L225 Difference]: With dead ends: 143 [2019-09-08 01:14:05,000 INFO L226 Difference]: Without dead ends: 138 [2019-09-08 01:14:05,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:14:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-08 01:14:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2019-09-08 01:14:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-08 01:14:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 197 transitions. [2019-09-08 01:14:05,006 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 197 transitions. Word has length 100 [2019-09-08 01:14:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:05,006 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 197 transitions. [2019-09-08 01:14:05,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 01:14:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 197 transitions. [2019-09-08 01:14:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 01:14:05,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:05,007 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:05,008 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1530993812, now seen corresponding path program 31 times [2019-09-08 01:14:05,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:05,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:05,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:05,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:05,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:05,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:05,645 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:14:05,668 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:14:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:05,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 01:14:05,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:05,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:05,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-08 01:14:05,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 01:14:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 01:14:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:14:05,783 INFO L87 Difference]: Start difference. First operand 135 states and 197 transitions. Second operand 34 states. [2019-09-08 01:14:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:05,933 INFO L93 Difference]: Finished difference Result 147 states and 213 transitions. [2019-09-08 01:14:05,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 01:14:05,934 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2019-09-08 01:14:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:05,935 INFO L225 Difference]: With dead ends: 147 [2019-09-08 01:14:05,935 INFO L226 Difference]: Without dead ends: 142 [2019-09-08 01:14:05,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:14:05,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-08 01:14:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2019-09-08 01:14:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-08 01:14:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 203 transitions. [2019-09-08 01:14:05,941 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 203 transitions. Word has length 103 [2019-09-08 01:14:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:05,941 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 203 transitions. [2019-09-08 01:14:05,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 01:14:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 203 transitions. [2019-09-08 01:14:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 01:14:05,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:05,943 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:05,943 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:05,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:05,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1195459663, now seen corresponding path program 32 times [2019-09-08 01:14:05,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:05,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:05,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:05,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:05,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:06,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:06,423 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:14:06,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:06,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:06,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:06,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 01:14:06,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:14:06,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:06,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-08 01:14:06,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 01:14:06,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 01:14:06,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:14:06,550 INFO L87 Difference]: Start difference. First operand 139 states and 203 transitions. Second operand 35 states. [2019-09-08 01:14:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:06,699 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2019-09-08 01:14:06,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 01:14:06,700 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2019-09-08 01:14:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:06,701 INFO L225 Difference]: With dead ends: 151 [2019-09-08 01:14:06,701 INFO L226 Difference]: Without dead ends: 146 [2019-09-08 01:14:06,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:14:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-08 01:14:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-09-08 01:14:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-08 01:14:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2019-09-08 01:14:06,707 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 106 [2019-09-08 01:14:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:06,707 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2019-09-08 01:14:06,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 01:14:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2019-09-08 01:14:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 01:14:06,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:06,709 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:06,709 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1450568564, now seen corresponding path program 33 times [2019-09-08 01:14:06,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:06,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:06,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:06,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:06,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:07,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:07,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:07,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:14:07,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-08 01:14:07,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:07,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 01:14:07,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:07,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:07,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-08 01:14:07,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 01:14:07,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 01:14:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:14:07,518 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand 36 states. [2019-09-08 01:14:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:07,673 INFO L93 Difference]: Finished difference Result 155 states and 225 transitions. [2019-09-08 01:14:07,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 01:14:07,674 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2019-09-08 01:14:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:07,675 INFO L225 Difference]: With dead ends: 155 [2019-09-08 01:14:07,675 INFO L226 Difference]: Without dead ends: 150 [2019-09-08 01:14:07,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:14:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-08 01:14:07,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-09-08 01:14:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-08 01:14:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2019-09-08 01:14:07,681 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 215 transitions. Word has length 109 [2019-09-08 01:14:07,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:07,682 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 215 transitions. [2019-09-08 01:14:07,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 01:14:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2019-09-08 01:14:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 01:14:07,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:07,684 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:07,684 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:07,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:07,684 INFO L82 PathProgramCache]: Analyzing trace with hash -552271663, now seen corresponding path program 34 times [2019-09-08 01:14:07,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:07,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:07,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:08,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:08,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:08,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:14:08,315 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:14:08,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:08,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 01:14:08,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:08,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:08,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-08 01:14:08,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 01:14:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 01:14:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:14:08,348 INFO L87 Difference]: Start difference. First operand 147 states and 215 transitions. Second operand 37 states. [2019-09-08 01:14:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:08,526 INFO L93 Difference]: Finished difference Result 159 states and 231 transitions. [2019-09-08 01:14:08,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 01:14:08,526 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2019-09-08 01:14:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:08,527 INFO L225 Difference]: With dead ends: 159 [2019-09-08 01:14:08,527 INFO L226 Difference]: Without dead ends: 154 [2019-09-08 01:14:08,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 113 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:14:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-08 01:14:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-09-08 01:14:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-08 01:14:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2019-09-08 01:14:08,533 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 112 [2019-09-08 01:14:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:08,533 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2019-09-08 01:14:08,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 01:14:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2019-09-08 01:14:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 01:14:08,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:08,535 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:08,535 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:08,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1479798188, now seen corresponding path program 35 times [2019-09-08 01:14:08,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:08,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:08,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:08,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:08,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:09,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:09,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:09,095 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:14:09,206 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-08 01:14:09,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:09,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 01:14:09,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 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:14:09,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:09,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-08 01:14:09,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 01:14:09,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 01:14:09,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 01:14:09,240 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand 38 states. [2019-09-08 01:14:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:09,403 INFO L93 Difference]: Finished difference Result 163 states and 237 transitions. [2019-09-08 01:14:09,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 01:14:09,403 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2019-09-08 01:14:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:09,407 INFO L225 Difference]: With dead ends: 163 [2019-09-08 01:14:09,407 INFO L226 Difference]: Without dead ends: 158 [2019-09-08 01:14:09,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 01:14:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-08 01:14:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2019-09-08 01:14:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-08 01:14:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 227 transitions. [2019-09-08 01:14:09,414 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 227 transitions. Word has length 115 [2019-09-08 01:14:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:09,417 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 227 transitions. [2019-09-08 01:14:09,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 01:14:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 227 transitions. [2019-09-08 01:14:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 01:14:09,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:09,420 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:09,420 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash 397078001, now seen corresponding path program 36 times [2019-09-08 01:14:09,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:09,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:09,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:10,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:10,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:10,131 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:14:10,251 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-08 01:14:10,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:10,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 01:14:10,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:10,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:10,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-08 01:14:10,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 01:14:10,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 01:14:10,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:14:10,296 INFO L87 Difference]: Start difference. First operand 155 states and 227 transitions. Second operand 39 states. [2019-09-08 01:14:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:10,453 INFO L93 Difference]: Finished difference Result 167 states and 243 transitions. [2019-09-08 01:14:10,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 01:14:10,453 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2019-09-08 01:14:10,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:10,455 INFO L225 Difference]: With dead ends: 167 [2019-09-08 01:14:10,455 INFO L226 Difference]: Without dead ends: 162 [2019-09-08 01:14:10,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:14:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-08 01:14:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2019-09-08 01:14:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-08 01:14:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 233 transitions. [2019-09-08 01:14:10,460 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 233 transitions. Word has length 118 [2019-09-08 01:14:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:10,461 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 233 transitions. [2019-09-08 01:14:10,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 01:14:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 233 transitions. [2019-09-08 01:14:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 01:14:10,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:10,462 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:10,463 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:10,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:10,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1763602124, now seen corresponding path program 37 times [2019-09-08 01:14:10,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:10,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:10,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:10,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:10,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:11,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:11,094 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:14:11,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:11,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 01:14:11,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:11,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:11,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-08 01:14:11,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 01:14:11,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 01:14:11,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:14:11,227 INFO L87 Difference]: Start difference. First operand 159 states and 233 transitions. Second operand 40 states. [2019-09-08 01:14:11,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:11,395 INFO L93 Difference]: Finished difference Result 171 states and 249 transitions. [2019-09-08 01:14:11,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 01:14:11,396 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2019-09-08 01:14:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:11,397 INFO L225 Difference]: With dead ends: 171 [2019-09-08 01:14:11,397 INFO L226 Difference]: Without dead ends: 166 [2019-09-08 01:14:11,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:14:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-08 01:14:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2019-09-08 01:14:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-08 01:14:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-09-08 01:14:11,403 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 121 [2019-09-08 01:14:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:11,403 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-09-08 01:14:11,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 01:14:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-09-08 01:14:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 01:14:11,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:11,404 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:11,405 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1910340847, now seen corresponding path program 38 times [2019-09-08 01:14:11,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:11,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:11,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:12,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:12,058 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:14:12,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:12,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:12,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:12,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 01:14:12,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:12,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:12,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-08 01:14:12,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 01:14:12,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 01:14:12,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:14:12,204 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 41 states. [2019-09-08 01:14:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:12,357 INFO L93 Difference]: Finished difference Result 175 states and 255 transitions. [2019-09-08 01:14:12,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 01:14:12,357 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2019-09-08 01:14:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:12,359 INFO L225 Difference]: With dead ends: 175 [2019-09-08 01:14:12,359 INFO L226 Difference]: Without dead ends: 170 [2019-09-08 01:14:12,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 125 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:14:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-08 01:14:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-09-08 01:14:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-08 01:14:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2019-09-08 01:14:12,364 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 124 [2019-09-08 01:14:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:12,365 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2019-09-08 01:14:12,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 01:14:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2019-09-08 01:14:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 01:14:12,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:12,366 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:12,366 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:12,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1126930412, now seen corresponding path program 39 times [2019-09-08 01:14:12,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:12,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:12,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:12,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:13,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:13,184 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:14:13,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:14:13,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-08 01:14:13,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:13,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 01:14:13,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:13,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:13,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-08 01:14:13,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 01:14:13,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 01:14:13,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:14:13,352 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand 42 states. [2019-09-08 01:14:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:13,559 INFO L93 Difference]: Finished difference Result 179 states and 261 transitions. [2019-09-08 01:14:13,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 01:14:13,560 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2019-09-08 01:14:13,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:13,562 INFO L225 Difference]: With dead ends: 179 [2019-09-08 01:14:13,562 INFO L226 Difference]: Without dead ends: 174 [2019-09-08 01:14:13,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:14:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-08 01:14:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-09-08 01:14:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-08 01:14:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 251 transitions. [2019-09-08 01:14:13,569 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 251 transitions. Word has length 127 [2019-09-08 01:14:13,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:13,570 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 251 transitions. [2019-09-08 01:14:13,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 01:14:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 251 transitions. [2019-09-08 01:14:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 01:14:13,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:13,572 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:13,572 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:13,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1398947791, now seen corresponding path program 40 times [2019-09-08 01:14:13,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:13,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:13,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:13,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:13,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:14,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:14,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 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:14:14,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:14:14,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:14:14,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:14,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 01:14:14,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:14:14,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:14,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-08 01:14:14,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 01:14:14,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 01:14:14,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:14:14,740 INFO L87 Difference]: Start difference. First operand 171 states and 251 transitions. Second operand 43 states. [2019-09-08 01:14:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:14,912 INFO L93 Difference]: Finished difference Result 183 states and 267 transitions. [2019-09-08 01:14:14,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 01:14:14,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2019-09-08 01:14:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:14,915 INFO L225 Difference]: With dead ends: 183 [2019-09-08 01:14:14,915 INFO L226 Difference]: Without dead ends: 178 [2019-09-08 01:14:14,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:14:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-08 01:14:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2019-09-08 01:14:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-08 01:14:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 257 transitions. [2019-09-08 01:14:14,922 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 257 transitions. Word has length 130 [2019-09-08 01:14:14,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:14,922 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 257 transitions. [2019-09-08 01:14:14,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 01:14:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 257 transitions. [2019-09-08 01:14:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 01:14:14,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:14,923 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:14,923 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:14,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:14,924 INFO L82 PathProgramCache]: Analyzing trace with hash -465398028, now seen corresponding path program 41 times [2019-09-08 01:14:14,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:14,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:14,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:14,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:14,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:15,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:15,658 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:14:15,669 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:14:15,800 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-08 01:14:15,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:15,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 01:14:15,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:15,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:15,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-08 01:14:15,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 01:14:15,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 01:14:15,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:14:15,839 INFO L87 Difference]: Start difference. First operand 175 states and 257 transitions. Second operand 44 states. [2019-09-08 01:14:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:16,071 INFO L93 Difference]: Finished difference Result 187 states and 273 transitions. [2019-09-08 01:14:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 01:14:16,071 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2019-09-08 01:14:16,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:16,073 INFO L225 Difference]: With dead ends: 187 [2019-09-08 01:14:16,073 INFO L226 Difference]: Without dead ends: 182 [2019-09-08 01:14:16,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:14:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-08 01:14:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2019-09-08 01:14:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-08 01:14:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 263 transitions. [2019-09-08 01:14:16,080 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 263 transitions. Word has length 133 [2019-09-08 01:14:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:16,080 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 263 transitions. [2019-09-08 01:14:16,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 01:14:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 263 transitions. [2019-09-08 01:14:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 01:14:16,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:16,082 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:16,083 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:16,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1002349905, now seen corresponding path program 42 times [2019-09-08 01:14:16,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:16,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:16,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:16,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:16,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:16,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:16,929 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:14:16,940 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:14:17,072 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-08 01:14:17,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:17,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 01:14:17,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:17,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:17,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-08 01:14:17,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 01:14:17,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 01:14:17,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 01:14:17,112 INFO L87 Difference]: Start difference. First operand 179 states and 263 transitions. Second operand 45 states. [2019-09-08 01:14:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:17,275 INFO L93 Difference]: Finished difference Result 191 states and 279 transitions. [2019-09-08 01:14:17,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 01:14:17,276 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2019-09-08 01:14:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:17,278 INFO L225 Difference]: With dead ends: 191 [2019-09-08 01:14:17,278 INFO L226 Difference]: Without dead ends: 186 [2019-09-08 01:14:17,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 137 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:14:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-08 01:14:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2019-09-08 01:14:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-08 01:14:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 269 transitions. [2019-09-08 01:14:17,284 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 269 transitions. Word has length 136 [2019-09-08 01:14:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:17,285 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 269 transitions. [2019-09-08 01:14:17,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 01:14:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 269 transitions. [2019-09-08 01:14:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 01:14:17,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:17,286 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:17,287 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:17,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:17,288 INFO L82 PathProgramCache]: Analyzing trace with hash -381018668, now seen corresponding path program 43 times [2019-09-08 01:14:17,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:17,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:17,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:17,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:17,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:18,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:18,173 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:14:18,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:18,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 01:14:18,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:14:18,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:18,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-08 01:14:18,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 01:14:18,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 01:14:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:14:18,316 INFO L87 Difference]: Start difference. First operand 183 states and 269 transitions. Second operand 46 states. [2019-09-08 01:14:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:18,529 INFO L93 Difference]: Finished difference Result 195 states and 285 transitions. [2019-09-08 01:14:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 01:14:18,530 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 139 [2019-09-08 01:14:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:18,531 INFO L225 Difference]: With dead ends: 195 [2019-09-08 01:14:18,531 INFO L226 Difference]: Without dead ends: 190 [2019-09-08 01:14:18,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:14:18,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-08 01:14:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-09-08 01:14:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-08 01:14:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 275 transitions. [2019-09-08 01:14:18,543 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 275 transitions. Word has length 139 [2019-09-08 01:14:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:18,544 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 275 transitions. [2019-09-08 01:14:18,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 01:14:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 275 transitions. [2019-09-08 01:14:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 01:14:18,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:18,545 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:18,545 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:18,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2102971791, now seen corresponding path program 44 times [2019-09-08 01:14:18,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:18,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:18,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:18,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:19,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:19,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:19,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:19,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:19,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:19,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 01:14:19,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:19,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:19,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-08 01:14:19,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 01:14:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 01:14:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:14:19,550 INFO L87 Difference]: Start difference. First operand 187 states and 275 transitions. Second operand 47 states. [2019-09-08 01:14:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:19,753 INFO L93 Difference]: Finished difference Result 199 states and 291 transitions. [2019-09-08 01:14:19,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 01:14:19,753 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 142 [2019-09-08 01:14:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:19,755 INFO L225 Difference]: With dead ends: 199 [2019-09-08 01:14:19,755 INFO L226 Difference]: Without dead ends: 194 [2019-09-08 01:14:19,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:14:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-08 01:14:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-09-08 01:14:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-08 01:14:19,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 281 transitions. [2019-09-08 01:14:19,761 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 281 transitions. Word has length 142 [2019-09-08 01:14:19,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:19,762 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 281 transitions. [2019-09-08 01:14:19,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 01:14:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2019-09-08 01:14:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 01:14:19,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:19,763 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:19,763 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:19,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:19,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1719075660, now seen corresponding path program 45 times [2019-09-08 01:14:19,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:19,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:19,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:19,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:19,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:20,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:20,651 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:14:20,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:14:20,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-08 01:14:20,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:20,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 01:14:20,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:20,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:20,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-08 01:14:20,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 01:14:20,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 01:14:20,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:14:20,846 INFO L87 Difference]: Start difference. First operand 191 states and 281 transitions. Second operand 48 states. [2019-09-08 01:14:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:21,054 INFO L93 Difference]: Finished difference Result 203 states and 297 transitions. [2019-09-08 01:14:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 01:14:21,054 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 145 [2019-09-08 01:14:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:21,056 INFO L225 Difference]: With dead ends: 203 [2019-09-08 01:14:21,056 INFO L226 Difference]: Without dead ends: 198 [2019-09-08 01:14:21,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:14:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-08 01:14:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2019-09-08 01:14:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-08 01:14:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 287 transitions. [2019-09-08 01:14:21,062 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 287 transitions. Word has length 145 [2019-09-08 01:14:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:21,062 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 287 transitions. [2019-09-08 01:14:21,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 01:14:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 287 transitions. [2019-09-08 01:14:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 01:14:21,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:21,063 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:21,064 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1727621009, now seen corresponding path program 46 times [2019-09-08 01:14:21,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:21,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:21,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:21,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:21,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:21,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:21,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:21,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:14:22,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:14:22,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:22,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 01:14:22,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:22,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:22,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-08 01:14:22,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 01:14:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 01:14:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:14:22,143 INFO L87 Difference]: Start difference. First operand 195 states and 287 transitions. Second operand 49 states. [2019-09-08 01:14:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:22,570 INFO L93 Difference]: Finished difference Result 207 states and 303 transitions. [2019-09-08 01:14:22,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 01:14:22,571 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 148 [2019-09-08 01:14:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:22,573 INFO L225 Difference]: With dead ends: 207 [2019-09-08 01:14:22,573 INFO L226 Difference]: Without dead ends: 202 [2019-09-08 01:14:22,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:14:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-08 01:14:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2019-09-08 01:14:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-08 01:14:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 293 transitions. [2019-09-08 01:14:22,586 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 293 transitions. Word has length 148 [2019-09-08 01:14:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:22,586 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 293 transitions. [2019-09-08 01:14:22,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 01:14:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 293 transitions. [2019-09-08 01:14:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 01:14:22,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:22,588 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:22,588 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1810025580, now seen corresponding path program 47 times [2019-09-08 01:14:22,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:22,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:22,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:22,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:22,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:23,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:23,523 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) [2019-09-08 01:14:23,551 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:23,706 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-08 01:14:23,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:23,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 01:14:23,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:23,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:23,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-08 01:14:23,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 01:14:23,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 01:14:23,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:14:23,740 INFO L87 Difference]: Start difference. First operand 199 states and 293 transitions. Second operand 50 states. [2019-09-08 01:14:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:23,997 INFO L93 Difference]: Finished difference Result 211 states and 309 transitions. [2019-09-08 01:14:23,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 01:14:23,997 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 151 [2019-09-08 01:14:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:23,999 INFO L225 Difference]: With dead ends: 211 [2019-09-08 01:14:23,999 INFO L226 Difference]: Without dead ends: 206 [2019-09-08 01:14:23,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:14:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-08 01:14:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2019-09-08 01:14:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-08 01:14:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 299 transitions. [2019-09-08 01:14:24,004 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 299 transitions. Word has length 151 [2019-09-08 01:14:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:24,004 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 299 transitions. [2019-09-08 01:14:24,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 01:14:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 299 transitions. [2019-09-08 01:14:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 01:14:24,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:24,006 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:24,006 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1932049231, now seen corresponding path program 48 times [2019-09-08 01:14:24,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:24,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:24,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:24,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:24,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:25,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:25,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:14:25,068 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:14:25,233 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-08 01:14:25,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:25,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 01:14:25,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:25,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:25,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-08 01:14:25,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 01:14:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 01:14:25,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:14:25,270 INFO L87 Difference]: Start difference. First operand 203 states and 299 transitions. Second operand 51 states. [2019-09-08 01:14:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:25,549 INFO L93 Difference]: Finished difference Result 215 states and 315 transitions. [2019-09-08 01:14:25,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 01:14:25,550 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 154 [2019-09-08 01:14:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:25,551 INFO L225 Difference]: With dead ends: 215 [2019-09-08 01:14:25,551 INFO L226 Difference]: Without dead ends: 210 [2019-09-08 01:14:25,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:14:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-08 01:14:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2019-09-08 01:14:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-08 01:14:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 305 transitions. [2019-09-08 01:14:25,557 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 305 transitions. Word has length 154 [2019-09-08 01:14:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:25,557 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 305 transitions. [2019-09-08 01:14:25,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 01:14:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 305 transitions. [2019-09-08 01:14:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 01:14:25,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:25,559 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:25,559 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash 698663540, now seen corresponding path program 49 times [2019-09-08 01:14:25,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:25,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:25,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:26,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:26,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 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:14:26,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:26,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 01:14:26,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:14:26,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:26,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-08 01:14:26,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 01:14:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 01:14:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:14:26,766 INFO L87 Difference]: Start difference. First operand 207 states and 305 transitions. Second operand 52 states. [2019-09-08 01:14:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:27,091 INFO L93 Difference]: Finished difference Result 219 states and 321 transitions. [2019-09-08 01:14:27,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 01:14:27,091 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 157 [2019-09-08 01:14:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:27,093 INFO L225 Difference]: With dead ends: 219 [2019-09-08 01:14:27,093 INFO L226 Difference]: Without dead ends: 214 [2019-09-08 01:14:27,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:14:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-08 01:14:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-09-08 01:14:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-08 01:14:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2019-09-08 01:14:27,098 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 157 [2019-09-08 01:14:27,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:27,099 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2019-09-08 01:14:27,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 01:14:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2019-09-08 01:14:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 01:14:27,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:27,100 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:27,100 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:27,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:27,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1994574289, now seen corresponding path program 50 times [2019-09-08 01:14:27,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:27,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:27,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:27,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:27,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:28,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:28,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:28,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:28,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:28,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:28,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 01:14:28,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:28,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:28,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-08 01:14:28,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 01:14:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 01:14:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:14:28,302 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand 53 states. [2019-09-08 01:14:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:28,587 INFO L93 Difference]: Finished difference Result 223 states and 327 transitions. [2019-09-08 01:14:28,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 01:14:28,588 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 160 [2019-09-08 01:14:28,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:28,589 INFO L225 Difference]: With dead ends: 223 [2019-09-08 01:14:28,589 INFO L226 Difference]: Without dead ends: 218 [2019-09-08 01:14:28,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:14:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-08 01:14:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2019-09-08 01:14:28,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-08 01:14:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 317 transitions. [2019-09-08 01:14:28,594 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 317 transitions. Word has length 160 [2019-09-08 01:14:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:28,594 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 317 transitions. [2019-09-08 01:14:28,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 01:14:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 317 transitions. [2019-09-08 01:14:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 01:14:28,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:28,596 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:28,596 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:28,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:28,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1010674004, now seen corresponding path program 51 times [2019-09-08 01:14:28,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:28,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:28,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:29,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:29,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:29,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:14:29,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-08 01:14:29,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:29,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 01:14:29,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:29,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:29,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-08 01:14:29,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-08 01:14:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-08 01:14:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:14:29,965 INFO L87 Difference]: Start difference. First operand 215 states and 317 transitions. Second operand 54 states. [2019-09-08 01:14:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:30,291 INFO L93 Difference]: Finished difference Result 227 states and 333 transitions. [2019-09-08 01:14:30,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 01:14:30,291 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 163 [2019-09-08 01:14:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:30,293 INFO L225 Difference]: With dead ends: 227 [2019-09-08 01:14:30,293 INFO L226 Difference]: Without dead ends: 222 [2019-09-08 01:14:30,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 164 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:14:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-08 01:14:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2019-09-08 01:14:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-08 01:14:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2019-09-08 01:14:30,302 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 163 [2019-09-08 01:14:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:30,303 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2019-09-08 01:14:30,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-08 01:14:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2019-09-08 01:14:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 01:14:30,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:30,304 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:30,305 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:30,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:30,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1505888527, now seen corresponding path program 52 times [2019-09-08 01:14:30,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:30,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:30,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:30,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:30,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:31,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:31,443 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:14:31,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:14:31,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:14:31,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:31,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 01:14:31,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:14:31,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:31,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-08 01:14:31,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-08 01:14:31,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-08 01:14:31,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:14:31,633 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 55 states. [2019-09-08 01:14:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:31,919 INFO L93 Difference]: Finished difference Result 231 states and 339 transitions. [2019-09-08 01:14:31,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 01:14:31,920 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 166 [2019-09-08 01:14:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:31,921 INFO L225 Difference]: With dead ends: 231 [2019-09-08 01:14:31,921 INFO L226 Difference]: Without dead ends: 226 [2019-09-08 01:14:31,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:14:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-08 01:14:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2019-09-08 01:14:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-08 01:14:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 329 transitions. [2019-09-08 01:14:31,927 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 329 transitions. Word has length 166 [2019-09-08 01:14:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:31,928 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 329 transitions. [2019-09-08 01:14:31,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-08 01:14:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 329 transitions. [2019-09-08 01:14:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 01:14:31,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:31,930 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:31,930 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:31,930 INFO L82 PathProgramCache]: Analyzing trace with hash 528869428, now seen corresponding path program 53 times [2019-09-08 01:14:31,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:31,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:31,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:33,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:33,160 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:14:33,171 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:14:33,337 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-08 01:14:33,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:33,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 01:14:33,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:33,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:33,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-09-08 01:14:33,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-08 01:14:33,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-08 01:14:33,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:14:33,383 INFO L87 Difference]: Start difference. First operand 223 states and 329 transitions. Second operand 56 states. [2019-09-08 01:14:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:33,671 INFO L93 Difference]: Finished difference Result 235 states and 345 transitions. [2019-09-08 01:14:33,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 01:14:33,672 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 169 [2019-09-08 01:14:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:33,673 INFO L225 Difference]: With dead ends: 235 [2019-09-08 01:14:33,673 INFO L226 Difference]: Without dead ends: 230 [2019-09-08 01:14:33,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:14:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-08 01:14:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-09-08 01:14:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 01:14:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 335 transitions. [2019-09-08 01:14:33,678 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 335 transitions. Word has length 169 [2019-09-08 01:14:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:33,679 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 335 transitions. [2019-09-08 01:14:33,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-08 01:14:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 335 transitions. [2019-09-08 01:14:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 01:14:33,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:33,681 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:33,681 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:33,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1165308911, now seen corresponding path program 54 times [2019-09-08 01:14:33,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:33,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:33,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:33,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:33,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:34,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:34,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:34,852 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:14:35,028 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-08 01:14:35,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:35,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 01:14:35,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:35,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:35,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-08 01:14:35,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 01:14:35,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 01:14:35,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:14:35,071 INFO L87 Difference]: Start difference. First operand 227 states and 335 transitions. Second operand 57 states. [2019-09-08 01:14:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:35,385 INFO L93 Difference]: Finished difference Result 239 states and 351 transitions. [2019-09-08 01:14:35,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 01:14:35,385 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 172 [2019-09-08 01:14:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:35,386 INFO L225 Difference]: With dead ends: 239 [2019-09-08 01:14:35,387 INFO L226 Difference]: Without dead ends: 234 [2019-09-08 01:14:35,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:14:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-08 01:14:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-09-08 01:14:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-08 01:14:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 341 transitions. [2019-09-08 01:14:35,392 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 341 transitions. Word has length 172 [2019-09-08 01:14:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:35,393 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 341 transitions. [2019-09-08 01:14:35,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 01:14:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 341 transitions. [2019-09-08 01:14:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 01:14:35,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:35,395 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:35,395 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:35,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:35,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2023456532, now seen corresponding path program 55 times [2019-09-08 01:14:35,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:35,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:35,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:35,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:35,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:36,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:36,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:36,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:36,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 01:14:36,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:36,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:36,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-09-08 01:14:36,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-08 01:14:36,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-08 01:14:36,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 01:14:36,857 INFO L87 Difference]: Start difference. First operand 231 states and 341 transitions. Second operand 58 states. [2019-09-08 01:14:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:37,196 INFO L93 Difference]: Finished difference Result 243 states and 357 transitions. [2019-09-08 01:14:37,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 01:14:37,196 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 175 [2019-09-08 01:14:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:37,198 INFO L225 Difference]: With dead ends: 243 [2019-09-08 01:14:37,198 INFO L226 Difference]: Without dead ends: 238 [2019-09-08 01:14:37,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 176 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:14:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-08 01:14:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2019-09-08 01:14:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-08 01:14:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 347 transitions. [2019-09-08 01:14:37,204 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 347 transitions. Word has length 175 [2019-09-08 01:14:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:37,205 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 347 transitions. [2019-09-08 01:14:37,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-08 01:14:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 347 transitions. [2019-09-08 01:14:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 01:14:37,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:37,206 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:37,206 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:37,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1846851279, now seen corresponding path program 56 times [2019-09-08 01:14:37,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:37,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:37,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:38,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:38,458 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:14:38,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:38,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:38,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:38,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 01:14:38,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:38,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:38,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-08 01:14:38,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 01:14:38,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 01:14:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 01:14:38,649 INFO L87 Difference]: Start difference. First operand 235 states and 347 transitions. Second operand 59 states. [2019-09-08 01:14:38,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:38,943 INFO L93 Difference]: Finished difference Result 247 states and 363 transitions. [2019-09-08 01:14:38,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 01:14:38,943 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 178 [2019-09-08 01:14:38,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:38,945 INFO L225 Difference]: With dead ends: 247 [2019-09-08 01:14:38,945 INFO L226 Difference]: Without dead ends: 242 [2019-09-08 01:14:38,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 179 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:14:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-08 01:14:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2019-09-08 01:14:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-08 01:14:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 353 transitions. [2019-09-08 01:14:38,951 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 353 transitions. Word has length 178 [2019-09-08 01:14:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:38,951 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 353 transitions. [2019-09-08 01:14:38,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 01:14:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 353 transitions. [2019-09-08 01:14:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 01:14:38,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:38,953 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:38,953 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash 505179636, now seen corresponding path program 57 times [2019-09-08 01:14:38,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:38,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:38,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:40,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:40,520 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:14:40,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:14:40,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-08 01:14:40,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:40,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 01:14:40,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:40,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:40,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-09-08 01:14:40,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-08 01:14:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-08 01:14:40,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:14:40,776 INFO L87 Difference]: Start difference. First operand 239 states and 353 transitions. Second operand 60 states. [2019-09-08 01:14:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:41,361 INFO L93 Difference]: Finished difference Result 251 states and 369 transitions. [2019-09-08 01:14:41,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 01:14:41,361 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 181 [2019-09-08 01:14:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:41,365 INFO L225 Difference]: With dead ends: 251 [2019-09-08 01:14:41,365 INFO L226 Difference]: Without dead ends: 246 [2019-09-08 01:14:41,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:14:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-08 01:14:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2019-09-08 01:14:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-08 01:14:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 359 transitions. [2019-09-08 01:14:41,371 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 359 transitions. Word has length 181 [2019-09-08 01:14:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:41,371 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 359 transitions. [2019-09-08 01:14:41,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-08 01:14:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 359 transitions. [2019-09-08 01:14:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 01:14:41,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:41,373 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:41,373 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:41,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1761701457, now seen corresponding path program 58 times [2019-09-08 01:14:41,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:41,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:41,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:42,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:42,824 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:14:42,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:14:42,969 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:14:42,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:42,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 01:14:42,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:43,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:43,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-08 01:14:43,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-08 01:14:43,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-08 01:14:43,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:14:43,019 INFO L87 Difference]: Start difference. First operand 243 states and 359 transitions. Second operand 61 states. [2019-09-08 01:14:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:43,303 INFO L93 Difference]: Finished difference Result 255 states and 375 transitions. [2019-09-08 01:14:43,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 01:14:43,303 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 184 [2019-09-08 01:14:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:43,305 INFO L225 Difference]: With dead ends: 255 [2019-09-08 01:14:43,305 INFO L226 Difference]: Without dead ends: 250 [2019-09-08 01:14:43,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:14:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-08 01:14:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2019-09-08 01:14:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-08 01:14:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 365 transitions. [2019-09-08 01:14:43,311 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 365 transitions. Word has length 184 [2019-09-08 01:14:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:43,312 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 365 transitions. [2019-09-08 01:14:43,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-08 01:14:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 365 transitions. [2019-09-08 01:14:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 01:14:43,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:43,313 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:43,314 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash -131681068, now seen corresponding path program 59 times [2019-09-08 01:14:43,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:43,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:43,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:43,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:43,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:44,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:44,740 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:14:44,750 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:14:44,949 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-08 01:14:44,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:44,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 01:14:44,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:44,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:44,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-09-08 01:14:44,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-08 01:14:44,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-08 01:14:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 01:14:44,993 INFO L87 Difference]: Start difference. First operand 247 states and 365 transitions. Second operand 62 states. [2019-09-08 01:14:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:45,451 INFO L93 Difference]: Finished difference Result 259 states and 381 transitions. [2019-09-08 01:14:45,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-08 01:14:45,452 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 187 [2019-09-08 01:14:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:45,453 INFO L225 Difference]: With dead ends: 259 [2019-09-08 01:14:45,454 INFO L226 Difference]: Without dead ends: 254 [2019-09-08 01:14:45,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 188 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:14:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-08 01:14:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-09-08 01:14:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-08 01:14:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 371 transitions. [2019-09-08 01:14:45,460 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 371 transitions. Word has length 187 [2019-09-08 01:14:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:45,460 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 371 transitions. [2019-09-08 01:14:45,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-08 01:14:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 371 transitions. [2019-09-08 01:14:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 01:14:45,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:45,462 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:45,462 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash -84984975, now seen corresponding path program 60 times [2019-09-08 01:14:45,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:45,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:45,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:46,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:46,931 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:14:46,941 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:14:47,139 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-08 01:14:47,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:47,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 01:14:47,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (61)] Exception during sending of exit command (exit): Stream closed [2019-09-08 01:14:47,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:47,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-08 01:14:47,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-08 01:14:47,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-08 01:14:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:14:47,195 INFO L87 Difference]: Start difference. First operand 251 states and 371 transitions. Second operand 63 states. [2019-09-08 01:14:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:47,856 INFO L93 Difference]: Finished difference Result 263 states and 387 transitions. [2019-09-08 01:14:47,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 01:14:47,856 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 190 [2019-09-08 01:14:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:47,858 INFO L225 Difference]: With dead ends: 263 [2019-09-08 01:14:47,858 INFO L226 Difference]: Without dead ends: 258 [2019-09-08 01:14:47,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:14:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-08 01:14:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2019-09-08 01:14:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 01:14:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 377 transitions. [2019-09-08 01:14:47,862 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 377 transitions. Word has length 190 [2019-09-08 01:14:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:47,863 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 377 transitions. [2019-09-08 01:14:47,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-08 01:14:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 377 transitions. [2019-09-08 01:14:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 01:14:47,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:47,864 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:47,864 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:47,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:47,864 INFO L82 PathProgramCache]: Analyzing trace with hash -531082316, now seen corresponding path program 61 times [2019-09-08 01:14:47,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:47,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:47,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:47,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:47,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:49,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:49,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:49,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:49,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 01:14:49,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:49,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:49,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-09-08 01:14:49,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-08 01:14:49,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-08 01:14:49,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:14:49,567 INFO L87 Difference]: Start difference. First operand 255 states and 377 transitions. Second operand 64 states. [2019-09-08 01:14:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:49,981 INFO L93 Difference]: Finished difference Result 267 states and 393 transitions. [2019-09-08 01:14:49,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 01:14:49,982 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 193 [2019-09-08 01:14:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:49,983 INFO L225 Difference]: With dead ends: 267 [2019-09-08 01:14:49,983 INFO L226 Difference]: Without dead ends: 262 [2019-09-08 01:14:49,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:14:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-08 01:14:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 259. [2019-09-08 01:14:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-08 01:14:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 383 transitions. [2019-09-08 01:14:49,988 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 383 transitions. Word has length 193 [2019-09-08 01:14:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:49,989 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 383 transitions. [2019-09-08 01:14:49,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-08 01:14:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 383 transitions. [2019-09-08 01:14:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 01:14:49,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:49,990 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:49,990 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1588154223, now seen corresponding path program 62 times [2019-09-08 01:14:49,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:49,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:49,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:14:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:51,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:51,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 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:14:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:14:51,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:14:51,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:51,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 01:14:51,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:51,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:51,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-08 01:14:51,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-08 01:14:51,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-08 01:14:51,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:14:51,647 INFO L87 Difference]: Start difference. First operand 259 states and 383 transitions. Second operand 65 states. [2019-09-08 01:14:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:52,086 INFO L93 Difference]: Finished difference Result 271 states and 399 transitions. [2019-09-08 01:14:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 01:14:52,088 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 196 [2019-09-08 01:14:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:52,090 INFO L225 Difference]: With dead ends: 271 [2019-09-08 01:14:52,090 INFO L226 Difference]: Without dead ends: 266 [2019-09-08 01:14:52,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:14:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-08 01:14:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 263. [2019-09-08 01:14:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-08 01:14:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2019-09-08 01:14:52,095 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 196 [2019-09-08 01:14:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:52,095 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2019-09-08 01:14:52,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-08 01:14:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2019-09-08 01:14:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 01:14:52,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:52,097 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:52,097 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:52,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:52,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2117121388, now seen corresponding path program 63 times [2019-09-08 01:14:52,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:52,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:52,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:53,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:53,610 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:14:53,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:14:53,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-08 01:14:53,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:53,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 01:14:53,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:14:53,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:53,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-09-08 01:14:53,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-08 01:14:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-08 01:14:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 01:14:53,918 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand 66 states. [2019-09-08 01:14:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:54,395 INFO L93 Difference]: Finished difference Result 275 states and 405 transitions. [2019-09-08 01:14:54,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 01:14:54,395 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 199 [2019-09-08 01:14:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:54,396 INFO L225 Difference]: With dead ends: 275 [2019-09-08 01:14:54,397 INFO L226 Difference]: Without dead ends: 270 [2019-09-08 01:14:54,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 200 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:14:54,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-08 01:14:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-09-08 01:14:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-08 01:14:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 395 transitions. [2019-09-08 01:14:54,402 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 395 transitions. Word has length 199 [2019-09-08 01:14:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:54,402 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 395 transitions. [2019-09-08 01:14:54,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-08 01:14:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 395 transitions. [2019-09-08 01:14:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 01:14:54,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:54,403 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:54,404 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:54,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1952042417, now seen corresponding path program 64 times [2019-09-08 01:14:54,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:54,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:54,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:54,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:54,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:55,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:55,997 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:14:56,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:14:56,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:14:56,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:56,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-08 01:14:56,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:56,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:56,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-08 01:14:56,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-08 01:14:56,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-08 01:14:56,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:14:56,223 INFO L87 Difference]: Start difference. First operand 267 states and 395 transitions. Second operand 67 states. [2019-09-08 01:14:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:56,679 INFO L93 Difference]: Finished difference Result 279 states and 411 transitions. [2019-09-08 01:14:56,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 01:14:56,679 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 202 [2019-09-08 01:14:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:56,680 INFO L225 Difference]: With dead ends: 279 [2019-09-08 01:14:56,680 INFO L226 Difference]: Without dead ends: 274 [2019-09-08 01:14:56,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:14:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-08 01:14:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-09-08 01:14:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-08 01:14:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 401 transitions. [2019-09-08 01:14:56,685 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 401 transitions. Word has length 202 [2019-09-08 01:14:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:56,685 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 401 transitions. [2019-09-08 01:14:56,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-08 01:14:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 401 transitions. [2019-09-08 01:14:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 01:14:56,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:56,687 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:56,687 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:56,687 INFO L82 PathProgramCache]: Analyzing trace with hash 959027572, now seen corresponding path program 65 times [2019-09-08 01:14:56,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:56,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:56,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:56,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:56,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:14:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:58,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:14:58,323 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:14:58,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:14:58,556 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-09-08 01:14:58,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:14:58,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 01:14:58,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:14:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:14:58,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:14:58,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-09-08 01:14:58,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-08 01:14:58,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-08 01:14:58,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:14:58,619 INFO L87 Difference]: Start difference. First operand 271 states and 401 transitions. Second operand 68 states. [2019-09-08 01:14:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:14:59,130 INFO L93 Difference]: Finished difference Result 283 states and 417 transitions. [2019-09-08 01:14:59,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 01:14:59,131 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 205 [2019-09-08 01:14:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:14:59,132 INFO L225 Difference]: With dead ends: 283 [2019-09-08 01:14:59,132 INFO L226 Difference]: Without dead ends: 278 [2019-09-08 01:14:59,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:14:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-08 01:14:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 275. [2019-09-08 01:14:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-08 01:14:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 407 transitions. [2019-09-08 01:14:59,136 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 407 transitions. Word has length 205 [2019-09-08 01:14:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:14:59,137 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 407 transitions. [2019-09-08 01:14:59,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-08 01:14:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 407 transitions. [2019-09-08 01:14:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 01:14:59,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:14:59,138 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:14:59,138 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:14:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:14:59,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1788515025, now seen corresponding path program 66 times [2019-09-08 01:14:59,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:14:59,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:14:59,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:59,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:14:59,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:14:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:00,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:00,760 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:15:00,771 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:15:00,987 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-08 01:15:00,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:00,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-08 01:15:00,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:01,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:01,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-08 01:15:01,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-08 01:15:01,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-08 01:15:01,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:15:01,035 INFO L87 Difference]: Start difference. First operand 275 states and 407 transitions. Second operand 69 states. [2019-09-08 01:15:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:01,668 INFO L93 Difference]: Finished difference Result 287 states and 423 transitions. [2019-09-08 01:15:01,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 01:15:01,668 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 208 [2019-09-08 01:15:01,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:01,669 INFO L225 Difference]: With dead ends: 287 [2019-09-08 01:15:01,670 INFO L226 Difference]: Without dead ends: 282 [2019-09-08 01:15:01,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:15:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-08 01:15:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2019-09-08 01:15:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-08 01:15:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 413 transitions. [2019-09-08 01:15:01,674 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 413 transitions. Word has length 208 [2019-09-08 01:15:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:01,674 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 413 transitions. [2019-09-08 01:15:01,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-08 01:15:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 413 transitions. [2019-09-08 01:15:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 01:15:01,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:01,676 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:01,676 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:01,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:01,676 INFO L82 PathProgramCache]: Analyzing trace with hash -192593836, now seen corresponding path program 67 times [2019-09-08 01:15:01,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:01,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:01,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:01,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:01,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:03,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:03,405 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:15:03,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:15:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:03,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-08 01:15:03,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:03,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:03,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-09-08 01:15:03,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-08 01:15:03,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-08 01:15:03,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:15:03,615 INFO L87 Difference]: Start difference. First operand 279 states and 413 transitions. Second operand 70 states. [2019-09-08 01:15:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:04,241 INFO L93 Difference]: Finished difference Result 291 states and 429 transitions. [2019-09-08 01:15:04,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 01:15:04,242 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 211 [2019-09-08 01:15:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:04,243 INFO L225 Difference]: With dead ends: 291 [2019-09-08 01:15:04,243 INFO L226 Difference]: Without dead ends: 286 [2019-09-08 01:15:04,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 212 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:15:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-08 01:15:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2019-09-08 01:15:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-08 01:15:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 419 transitions. [2019-09-08 01:15:04,249 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 419 transitions. Word has length 211 [2019-09-08 01:15:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:04,249 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 419 transitions. [2019-09-08 01:15:04,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-08 01:15:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 419 transitions. [2019-09-08 01:15:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-08 01:15:04,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:04,251 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:04,251 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:04,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:04,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2033909745, now seen corresponding path program 68 times [2019-09-08 01:15:04,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:04,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:04,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:04,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:15:04,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:05,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:05,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:05,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:15:06,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:15:06,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:06,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 01:15:06,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:06,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:06,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-08 01:15:06,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-08 01:15:06,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-08 01:15:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 01:15:06,181 INFO L87 Difference]: Start difference. First operand 283 states and 419 transitions. Second operand 71 states. [2019-09-08 01:15:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:06,849 INFO L93 Difference]: Finished difference Result 295 states and 435 transitions. [2019-09-08 01:15:06,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-08 01:15:06,849 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 214 [2019-09-08 01:15:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:06,851 INFO L225 Difference]: With dead ends: 295 [2019-09-08 01:15:06,851 INFO L226 Difference]: Without dead ends: 290 [2019-09-08 01:15:06,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 215 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:15:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-08 01:15:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-09-08 01:15:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-08 01:15:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 425 transitions. [2019-09-08 01:15:06,856 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 425 transitions. Word has length 214 [2019-09-08 01:15:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:06,856 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 425 transitions. [2019-09-08 01:15:06,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-08 01:15:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 425 transitions. [2019-09-08 01:15:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 01:15:06,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:06,869 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:06,869 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:06,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:06,870 INFO L82 PathProgramCache]: Analyzing trace with hash 327171892, now seen corresponding path program 69 times [2019-09-08 01:15:06,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:06,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:06,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:06,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:06,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:08,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:08,680 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:15:08,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:15:08,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-08 01:15:08,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:08,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 01:15:08,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:08,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:08,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-09-08 01:15:08,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-08 01:15:08,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-08 01:15:08,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:15:08,998 INFO L87 Difference]: Start difference. First operand 287 states and 425 transitions. Second operand 72 states. [2019-09-08 01:15:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:09,628 INFO L93 Difference]: Finished difference Result 299 states and 441 transitions. [2019-09-08 01:15:09,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-08 01:15:09,628 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 217 [2019-09-08 01:15:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:09,630 INFO L225 Difference]: With dead ends: 299 [2019-09-08 01:15:09,631 INFO L226 Difference]: Without dead ends: 294 [2019-09-08 01:15:09,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:15:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-08 01:15:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-09-08 01:15:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-08 01:15:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions. [2019-09-08 01:15:09,636 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 217 [2019-09-08 01:15:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:09,637 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 431 transitions. [2019-09-08 01:15:09,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-08 01:15:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions. [2019-09-08 01:15:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 01:15:09,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:09,639 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:09,639 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:09,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1277356783, now seen corresponding path program 70 times [2019-09-08 01:15:09,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:09,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:09,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:09,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:09,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:11,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:11,478 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:15:11,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:15:11,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:15:11,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:11,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-08 01:15:11,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:11,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:11,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-08 01:15:11,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-08 01:15:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-08 01:15:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:15:11,685 INFO L87 Difference]: Start difference. First operand 291 states and 431 transitions. Second operand 73 states. [2019-09-08 01:15:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:12,211 INFO L93 Difference]: Finished difference Result 303 states and 447 transitions. [2019-09-08 01:15:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 01:15:12,211 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 220 [2019-09-08 01:15:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:12,213 INFO L225 Difference]: With dead ends: 303 [2019-09-08 01:15:12,213 INFO L226 Difference]: Without dead ends: 298 [2019-09-08 01:15:12,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 221 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:15:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-08 01:15:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 295. [2019-09-08 01:15:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-08 01:15:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 437 transitions. [2019-09-08 01:15:12,218 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 437 transitions. Word has length 220 [2019-09-08 01:15:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:12,218 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 437 transitions. [2019-09-08 01:15:12,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-08 01:15:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 437 transitions. [2019-09-08 01:15:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 01:15:12,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:12,220 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:12,220 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:12,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1194890772, now seen corresponding path program 71 times [2019-09-08 01:15:12,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:12,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:12,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:12,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:12,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:14,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:14,075 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:15:14,086 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:15:14,332 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-09-08 01:15:14,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:14,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-08 01:15:14,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:14,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:14,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-09-08 01:15:14,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-08 01:15:14,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-08 01:15:14,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:15:14,382 INFO L87 Difference]: Start difference. First operand 295 states and 437 transitions. Second operand 74 states. [2019-09-08 01:15:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:14,976 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-08 01:15:14,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-08 01:15:14,976 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 223 [2019-09-08 01:15:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:14,979 INFO L225 Difference]: With dead ends: 307 [2019-09-08 01:15:14,979 INFO L226 Difference]: Without dead ends: 302 [2019-09-08 01:15:14,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:15:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-08 01:15:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2019-09-08 01:15:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-08 01:15:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 443 transitions. [2019-09-08 01:15:14,984 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 443 transitions. Word has length 223 [2019-09-08 01:15:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:14,984 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 443 transitions. [2019-09-08 01:15:14,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-08 01:15:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 443 transitions. [2019-09-08 01:15:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 01:15:14,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:14,986 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:14,986 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:14,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1822609969, now seen corresponding path program 72 times [2019-09-08 01:15:14,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:14,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:14,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:14,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:14,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:16,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:16,868 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:15:16,879 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:15:17,129 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-08 01:15:17,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:17,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-08 01:15:17,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:17,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:17,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-08 01:15:17,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-08 01:15:17,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-08 01:15:17,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:15:17,194 INFO L87 Difference]: Start difference. First operand 299 states and 443 transitions. Second operand 75 states. [2019-09-08 01:15:17,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:17,836 INFO L93 Difference]: Finished difference Result 311 states and 459 transitions. [2019-09-08 01:15:17,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 01:15:17,837 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 226 [2019-09-08 01:15:17,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:17,838 INFO L225 Difference]: With dead ends: 311 [2019-09-08 01:15:17,838 INFO L226 Difference]: Without dead ends: 306 [2019-09-08 01:15:17,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:15:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-08 01:15:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303. [2019-09-08 01:15:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 01:15:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 449 transitions. [2019-09-08 01:15:17,843 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 449 transitions. Word has length 226 [2019-09-08 01:15:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:17,844 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 449 transitions. [2019-09-08 01:15:17,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-08 01:15:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 449 transitions. [2019-09-08 01:15:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 01:15:17,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:17,845 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:17,846 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:17,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1917601012, now seen corresponding path program 73 times [2019-09-08 01:15:17,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:17,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:17,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:17,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:17,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:19,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:19,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:19,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:15:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:19,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-08 01:15:19,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:20,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:20,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-09-08 01:15:20,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-08 01:15:20,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-08 01:15:20,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 01:15:20,011 INFO L87 Difference]: Start difference. First operand 303 states and 449 transitions. Second operand 76 states. [2019-09-08 01:15:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:20,706 INFO L93 Difference]: Finished difference Result 315 states and 465 transitions. [2019-09-08 01:15:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-08 01:15:20,706 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 229 [2019-09-08 01:15:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:20,708 INFO L225 Difference]: With dead ends: 315 [2019-09-08 01:15:20,708 INFO L226 Difference]: Without dead ends: 310 [2019-09-08 01:15:20,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 230 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:15:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-08 01:15:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2019-09-08 01:15:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-08 01:15:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 455 transitions. [2019-09-08 01:15:20,712 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 455 transitions. Word has length 229 [2019-09-08 01:15:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:20,713 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 455 transitions. [2019-09-08 01:15:20,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-08 01:15:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 455 transitions. [2019-09-08 01:15:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 01:15:20,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:20,714 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:20,714 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:20,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:20,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1412314961, now seen corresponding path program 74 times [2019-09-08 01:15:20,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:20,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:20,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:20,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:15:20,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:22,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:22,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:15:22,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:15:22,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:15:22,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:22,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 01:15:22,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:22,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:22,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-08 01:15:22,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-08 01:15:22,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-08 01:15:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:15:22,973 INFO L87 Difference]: Start difference. First operand 307 states and 455 transitions. Second operand 77 states. [2019-09-08 01:15:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:23,636 INFO L93 Difference]: Finished difference Result 319 states and 471 transitions. [2019-09-08 01:15:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 01:15:23,637 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 232 [2019-09-08 01:15:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:23,638 INFO L225 Difference]: With dead ends: 319 [2019-09-08 01:15:23,638 INFO L226 Difference]: Without dead ends: 314 [2019-09-08 01:15:23,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:15:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-08 01:15:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-09-08 01:15:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-08 01:15:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 461 transitions. [2019-09-08 01:15:23,643 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 461 transitions. Word has length 232 [2019-09-08 01:15:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:23,643 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 461 transitions. [2019-09-08 01:15:23,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-08 01:15:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 461 transitions. [2019-09-08 01:15:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 01:15:23,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:23,644 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:23,645 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:23,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1999025196, now seen corresponding path program 75 times [2019-09-08 01:15:23,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:23,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:23,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:25,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:25,811 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:15:25,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:15:26,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-09-08 01:15:26,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:26,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-08 01:15:26,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:26,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:26,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-09-08 01:15:26,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-08 01:15:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-08 01:15:26,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:15:26,176 INFO L87 Difference]: Start difference. First operand 311 states and 461 transitions. Second operand 78 states. [2019-09-08 01:15:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:26,903 INFO L93 Difference]: Finished difference Result 323 states and 477 transitions. [2019-09-08 01:15:26,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-08 01:15:26,903 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 235 [2019-09-08 01:15:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:26,906 INFO L225 Difference]: With dead ends: 323 [2019-09-08 01:15:26,906 INFO L226 Difference]: Without dead ends: 318 [2019-09-08 01:15:26,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 236 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:15:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-08 01:15:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 315. [2019-09-08 01:15:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 01:15:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2019-09-08 01:15:26,912 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 235 [2019-09-08 01:15:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:26,912 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2019-09-08 01:15:26,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-08 01:15:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2019-09-08 01:15:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 01:15:26,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:26,914 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:26,914 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:26,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1717484431, now seen corresponding path program 76 times [2019-09-08 01:15:26,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:26,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:26,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:29,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:29,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 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:15:29,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:15:29,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:15:29,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:29,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-08 01:15:29,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:29,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:29,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-08 01:15:29,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-08 01:15:29,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-08 01:15:29,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:15:29,252 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand 79 states. [2019-09-08 01:15:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:29,916 INFO L93 Difference]: Finished difference Result 327 states and 483 transitions. [2019-09-08 01:15:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 01:15:29,916 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 238 [2019-09-08 01:15:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:29,918 INFO L225 Difference]: With dead ends: 327 [2019-09-08 01:15:29,918 INFO L226 Difference]: Without dead ends: 322 [2019-09-08 01:15:29,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:15:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-08 01:15:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2019-09-08 01:15:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-08 01:15:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 473 transitions. [2019-09-08 01:15:29,922 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 473 transitions. Word has length 238 [2019-09-08 01:15:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:29,922 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 473 transitions. [2019-09-08 01:15:29,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-08 01:15:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 473 transitions. [2019-09-08 01:15:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 01:15:29,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:29,923 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:29,924 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1887283892, now seen corresponding path program 77 times [2019-09-08 01:15:29,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:29,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:29,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:29,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:32,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:32,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 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:15:32,135 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:15:32,409 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-09-08 01:15:32,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:32,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-08 01:15:32,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:32,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:32,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-09-08 01:15:32,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-08 01:15:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-08 01:15:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:15:32,466 INFO L87 Difference]: Start difference. First operand 319 states and 473 transitions. Second operand 80 states. [2019-09-08 01:15:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:33,266 INFO L93 Difference]: Finished difference Result 331 states and 489 transitions. [2019-09-08 01:15:33,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-08 01:15:33,267 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 241 [2019-09-08 01:15:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:33,269 INFO L225 Difference]: With dead ends: 331 [2019-09-08 01:15:33,269 INFO L226 Difference]: Without dead ends: 326 [2019-09-08 01:15:33,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:15:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-08 01:15:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 323. [2019-09-08 01:15:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-08 01:15:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 479 transitions. [2019-09-08 01:15:33,274 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 479 transitions. Word has length 241 [2019-09-08 01:15:33,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:33,274 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 479 transitions. [2019-09-08 01:15:33,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-08 01:15:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 479 transitions. [2019-09-08 01:15:33,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 01:15:33,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:33,276 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:33,276 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:33,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:33,276 INFO L82 PathProgramCache]: Analyzing trace with hash 178125201, now seen corresponding path program 78 times [2019-09-08 01:15:33,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:33,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:33,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:33,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:33,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:35,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:35,528 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:15:35,538 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:15:35,853 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-08 01:15:35,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:35,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 01:15:35,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:35,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:35,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-08 01:15:35,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-08 01:15:35,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-08 01:15:35,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 01:15:35,916 INFO L87 Difference]: Start difference. First operand 323 states and 479 transitions. Second operand 81 states. [2019-09-08 01:15:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:36,853 INFO L93 Difference]: Finished difference Result 335 states and 495 transitions. [2019-09-08 01:15:36,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 01:15:36,854 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 244 [2019-09-08 01:15:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:36,855 INFO L225 Difference]: With dead ends: 335 [2019-09-08 01:15:36,855 INFO L226 Difference]: Without dead ends: 330 [2019-09-08 01:15:36,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 245 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:15:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-08 01:15:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2019-09-08 01:15:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-08 01:15:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 485 transitions. [2019-09-08 01:15:36,861 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 485 transitions. Word has length 244 [2019-09-08 01:15:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:36,861 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 485 transitions. [2019-09-08 01:15:36,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-08 01:15:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 485 transitions. [2019-09-08 01:15:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 01:15:36,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:36,863 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:36,863 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash -531144300, now seen corresponding path program 79 times [2019-09-08 01:15:36,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:36,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:36,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:39,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:39,163 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:15:39,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:15:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:39,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-08 01:15:39,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:39,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:39,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-09-08 01:15:39,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-08 01:15:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-08 01:15:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:15:39,409 INFO L87 Difference]: Start difference. First operand 327 states and 485 transitions. Second operand 82 states. [2019-09-08 01:15:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:40,392 INFO L93 Difference]: Finished difference Result 339 states and 501 transitions. [2019-09-08 01:15:40,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-08 01:15:40,393 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 247 [2019-09-08 01:15:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:40,394 INFO L225 Difference]: With dead ends: 339 [2019-09-08 01:15:40,394 INFO L226 Difference]: Without dead ends: 334 [2019-09-08 01:15:40,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:15:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-08 01:15:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-09-08 01:15:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-08 01:15:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 491 transitions. [2019-09-08 01:15:40,399 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 491 transitions. Word has length 247 [2019-09-08 01:15:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:40,399 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 491 transitions. [2019-09-08 01:15:40,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-08 01:15:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2019-09-08 01:15:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 01:15:40,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:40,401 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:40,401 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash 860247729, now seen corresponding path program 80 times [2019-09-08 01:15:40,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:40,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:40,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:40,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:15:40,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:42,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:42,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 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:15:42,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:15:43,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:15:43,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:43,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-08 01:15:43,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:43,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:43,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-08 01:15:43,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-08 01:15:43,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-08 01:15:43,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:15:43,141 INFO L87 Difference]: Start difference. First operand 331 states and 491 transitions. Second operand 83 states. [2019-09-08 01:15:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:44,161 INFO L93 Difference]: Finished difference Result 343 states and 507 transitions. [2019-09-08 01:15:44,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-08 01:15:44,161 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 250 [2019-09-08 01:15:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:44,163 INFO L225 Difference]: With dead ends: 343 [2019-09-08 01:15:44,163 INFO L226 Difference]: Without dead ends: 338 [2019-09-08 01:15:44,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:15:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-08 01:15:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 335. [2019-09-08 01:15:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-08 01:15:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 497 transitions. [2019-09-08 01:15:44,167 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 497 transitions. Word has length 250 [2019-09-08 01:15:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:44,168 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 497 transitions. [2019-09-08 01:15:44,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-08 01:15:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 497 transitions. [2019-09-08 01:15:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 01:15:44,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:44,169 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:44,170 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:44,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1090809972, now seen corresponding path program 81 times [2019-09-08 01:15:44,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:44,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:44,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:44,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:44,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:46,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:46,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:46,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:15:46,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-09-08 01:15:46,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:46,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-08 01:15:46,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:47,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:47,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-09-08 01:15:47,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-08 01:15:47,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-08 01:15:47,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:15:47,029 INFO L87 Difference]: Start difference. First operand 335 states and 497 transitions. Second operand 84 states. [2019-09-08 01:15:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:48,057 INFO L93 Difference]: Finished difference Result 347 states and 513 transitions. [2019-09-08 01:15:48,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 01:15:48,058 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 253 [2019-09-08 01:15:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:48,059 INFO L225 Difference]: With dead ends: 347 [2019-09-08 01:15:48,059 INFO L226 Difference]: Without dead ends: 342 [2019-09-08 01:15:48,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:15:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-08 01:15:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 339. [2019-09-08 01:15:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-08 01:15:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 503 transitions. [2019-09-08 01:15:48,064 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 503 transitions. Word has length 253 [2019-09-08 01:15:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:48,064 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 503 transitions. [2019-09-08 01:15:48,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-08 01:15:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 503 transitions. [2019-09-08 01:15:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 01:15:48,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:48,066 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:48,066 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:48,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2117884881, now seen corresponding path program 82 times [2019-09-08 01:15:48,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:48,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:48,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:50,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:50,610 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:15:50,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:15:50,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:15:50,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:50,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-08 01:15:50,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:50,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:50,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-08 01:15:50,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-08 01:15:50,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-08 01:15:50,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:15:50,918 INFO L87 Difference]: Start difference. First operand 339 states and 503 transitions. Second operand 85 states. [2019-09-08 01:15:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:51,725 INFO L93 Difference]: Finished difference Result 351 states and 519 transitions. [2019-09-08 01:15:51,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-08 01:15:51,726 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 256 [2019-09-08 01:15:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:51,728 INFO L225 Difference]: With dead ends: 351 [2019-09-08 01:15:51,728 INFO L226 Difference]: Without dead ends: 346 [2019-09-08 01:15:51,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:15:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-08 01:15:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 343. [2019-09-08 01:15:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-08 01:15:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 509 transitions. [2019-09-08 01:15:51,733 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 509 transitions. Word has length 256 [2019-09-08 01:15:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:51,733 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 509 transitions. [2019-09-08 01:15:51,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-08 01:15:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 509 transitions. [2019-09-08 01:15:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 01:15:51,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:51,735 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:51,735 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:51,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:51,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1935485100, now seen corresponding path program 83 times [2019-09-08 01:15:51,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:51,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:51,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:51,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:51,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:54,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:54,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:54,444 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:15:54,784 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-09-08 01:15:54,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:54,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-08 01:15:54,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:54,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:54,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-09-08 01:15:54,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-08 01:15:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-08 01:15:54,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:15:54,848 INFO L87 Difference]: Start difference. First operand 343 states and 509 transitions. Second operand 86 states. [2019-09-08 01:15:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:55,915 INFO L93 Difference]: Finished difference Result 355 states and 525 transitions. [2019-09-08 01:15:55,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-08 01:15:55,916 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 259 [2019-09-08 01:15:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:55,917 INFO L225 Difference]: With dead ends: 355 [2019-09-08 01:15:55,917 INFO L226 Difference]: Without dead ends: 350 [2019-09-08 01:15:55,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:15:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-08 01:15:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-09-08 01:15:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-08 01:15:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 515 transitions. [2019-09-08 01:15:55,922 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 515 transitions. Word has length 259 [2019-09-08 01:15:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:55,922 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 515 transitions. [2019-09-08 01:15:55,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-08 01:15:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 515 transitions. [2019-09-08 01:15:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 01:15:55,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:55,924 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:55,924 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:55,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1419905265, now seen corresponding path program 84 times [2019-09-08 01:15:55,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:55,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:55,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:55,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:55,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:15:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:58,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:15:58,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:58,541 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:15:58,860 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-09-08 01:15:58,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:15:58,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 01:15:58,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:15:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:15:58,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:15:58,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-08 01:15:58,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-08 01:15:58,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-08 01:15:58,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 01:15:58,944 INFO L87 Difference]: Start difference. First operand 347 states and 515 transitions. Second operand 87 states. [2019-09-08 01:15:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:15:59,690 INFO L93 Difference]: Finished difference Result 359 states and 531 transitions. [2019-09-08 01:15:59,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 01:15:59,690 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 262 [2019-09-08 01:15:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:15:59,692 INFO L225 Difference]: With dead ends: 359 [2019-09-08 01:15:59,692 INFO L226 Difference]: Without dead ends: 354 [2019-09-08 01:15:59,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 263 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:15:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-08 01:15:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-09-08 01:15:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-08 01:15:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 521 transitions. [2019-09-08 01:15:59,699 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 521 transitions. Word has length 262 [2019-09-08 01:15:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:15:59,699 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 521 transitions. [2019-09-08 01:15:59,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-08 01:15:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 521 transitions. [2019-09-08 01:15:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 01:15:59,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:15:59,700 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:15:59,701 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:15:59,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:15:59,701 INFO L82 PathProgramCache]: Analyzing trace with hash 785421876, now seen corresponding path program 85 times [2019-09-08 01:15:59,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:15:59,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:15:59,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:59,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:15:59,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:15:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:02,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:02,370 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:16:02,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:02,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-08 01:16:02,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:02,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:02,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-09-08 01:16:02,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-08 01:16:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-08 01:16:02,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:16:02,636 INFO L87 Difference]: Start difference. First operand 351 states and 521 transitions. Second operand 88 states. [2019-09-08 01:16:03,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:03,647 INFO L93 Difference]: Finished difference Result 363 states and 537 transitions. [2019-09-08 01:16:03,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-08 01:16:03,647 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 265 [2019-09-08 01:16:03,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:03,649 INFO L225 Difference]: With dead ends: 363 [2019-09-08 01:16:03,649 INFO L226 Difference]: Without dead ends: 358 [2019-09-08 01:16:03,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:16:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-08 01:16:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 355. [2019-09-08 01:16:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-08 01:16:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 527 transitions. [2019-09-08 01:16:03,653 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 527 transitions. Word has length 265 [2019-09-08 01:16:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:03,654 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 527 transitions. [2019-09-08 01:16:03,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-08 01:16:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 527 transitions. [2019-09-08 01:16:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 01:16:03,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:03,655 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:03,655 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1041849873, now seen corresponding path program 86 times [2019-09-08 01:16:03,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:03,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:03,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:03,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:03,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:06,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:06,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 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:16:06,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:06,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:06,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:06,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-08 01:16:06,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:06,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:06,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-08 01:16:06,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-08 01:16:06,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-08 01:16:06,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:16:06,648 INFO L87 Difference]: Start difference. First operand 355 states and 527 transitions. Second operand 89 states. [2019-09-08 01:16:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:07,740 INFO L93 Difference]: Finished difference Result 367 states and 543 transitions. [2019-09-08 01:16:07,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 01:16:07,741 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 268 [2019-09-08 01:16:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:07,744 INFO L225 Difference]: With dead ends: 367 [2019-09-08 01:16:07,744 INFO L226 Difference]: Without dead ends: 362 [2019-09-08 01:16:07,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 269 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:16:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-08 01:16:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 359. [2019-09-08 01:16:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-08 01:16:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 533 transitions. [2019-09-08 01:16:07,749 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 533 transitions. Word has length 268 [2019-09-08 01:16:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:07,749 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 533 transitions. [2019-09-08 01:16:07,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-08 01:16:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 533 transitions. [2019-09-08 01:16:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-08 01:16:07,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:07,751 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:07,751 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash -458511084, now seen corresponding path program 87 times [2019-09-08 01:16:07,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:07,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:07,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:10,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:10,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 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:16:10,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:10,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-09-08 01:16:10,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:10,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-08 01:16:10,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:11,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:11,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-09-08 01:16:11,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-08 01:16:11,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-08 01:16:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:16:11,043 INFO L87 Difference]: Start difference. First operand 359 states and 533 transitions. Second operand 90 states. [2019-09-08 01:16:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:12,099 INFO L93 Difference]: Finished difference Result 371 states and 549 transitions. [2019-09-08 01:16:12,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-08 01:16:12,100 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 271 [2019-09-08 01:16:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:12,101 INFO L225 Difference]: With dead ends: 371 [2019-09-08 01:16:12,102 INFO L226 Difference]: Without dead ends: 366 [2019-09-08 01:16:12,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:16:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-08 01:16:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 363. [2019-09-08 01:16:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-08 01:16:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 539 transitions. [2019-09-08 01:16:12,107 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 539 transitions. Word has length 271 [2019-09-08 01:16:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:12,107 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 539 transitions. [2019-09-08 01:16:12,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-08 01:16:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 539 transitions. [2019-09-08 01:16:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-08 01:16:12,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:12,108 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:12,108 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:12,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:12,109 INFO L82 PathProgramCache]: Analyzing trace with hash 12868401, now seen corresponding path program 88 times [2019-09-08 01:16:12,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:12,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:12,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:14,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:14,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 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:16:14,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:15,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:15,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:15,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-08 01:16:15,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:15,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:15,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-08 01:16:15,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-08 01:16:15,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-08 01:16:15,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:16:15,202 INFO L87 Difference]: Start difference. First operand 363 states and 539 transitions. Second operand 91 states. [2019-09-08 01:16:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:16,010 INFO L93 Difference]: Finished difference Result 375 states and 555 transitions. [2019-09-08 01:16:16,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-08 01:16:16,011 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 274 [2019-09-08 01:16:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:16,012 INFO L225 Difference]: With dead ends: 375 [2019-09-08 01:16:16,013 INFO L226 Difference]: Without dead ends: 370 [2019-09-08 01:16:16,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 275 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:16:16,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-08 01:16:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2019-09-08 01:16:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-08 01:16:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 545 transitions. [2019-09-08 01:16:16,017 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 545 transitions. Word has length 274 [2019-09-08 01:16:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:16,017 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 545 transitions. [2019-09-08 01:16:16,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-08 01:16:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 545 transitions. [2019-09-08 01:16:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 01:16:16,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:16,018 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:16,018 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:16,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1663951884, now seen corresponding path program 89 times [2019-09-08 01:16:16,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:16,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:16,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:18,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:18,898 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:16:18,910 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:19,299 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-09-08 01:16:19,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:19,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-08 01:16:19,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:19,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:19,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-09-08 01:16:19,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-08 01:16:19,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-08 01:16:19,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 01:16:19,367 INFO L87 Difference]: Start difference. First operand 367 states and 545 transitions. Second operand 92 states. [2019-09-08 01:16:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:20,671 INFO L93 Difference]: Finished difference Result 379 states and 561 transitions. [2019-09-08 01:16:20,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-08 01:16:20,671 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 277 [2019-09-08 01:16:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:20,673 INFO L225 Difference]: With dead ends: 379 [2019-09-08 01:16:20,673 INFO L226 Difference]: Without dead ends: 374 [2019-09-08 01:16:20,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 01:16:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-08 01:16:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-09-08 01:16:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-09-08 01:16:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 551 transitions. [2019-09-08 01:16:20,677 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 551 transitions. Word has length 277 [2019-09-08 01:16:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:20,678 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 551 transitions. [2019-09-08 01:16:20,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-08 01:16:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 551 transitions. [2019-09-08 01:16:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-08 01:16:20,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:20,679 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:20,679 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1052442543, now seen corresponding path program 90 times [2019-09-08 01:16:20,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:20,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:20,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:20,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:20,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:23,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:23,698 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:16:23,709 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:16:24,065 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-09-08 01:16:24,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:24,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-08 01:16:24,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:24,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:24,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-08 01:16:24,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-08 01:16:24,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-08 01:16:24,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 01:16:24,136 INFO L87 Difference]: Start difference. First operand 371 states and 551 transitions. Second operand 93 states. [2019-09-08 01:16:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:25,052 INFO L93 Difference]: Finished difference Result 383 states and 567 transitions. [2019-09-08 01:16:25,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-08 01:16:25,053 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 280 [2019-09-08 01:16:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:25,054 INFO L225 Difference]: With dead ends: 383 [2019-09-08 01:16:25,054 INFO L226 Difference]: Without dead ends: 378 [2019-09-08 01:16:25,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 281 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:16:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-08 01:16:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 375. [2019-09-08 01:16:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-08 01:16:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 557 transitions. [2019-09-08 01:16:25,059 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 557 transitions. Word has length 280 [2019-09-08 01:16:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:25,059 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 557 transitions. [2019-09-08 01:16:25,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-08 01:16:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 557 transitions. [2019-09-08 01:16:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 01:16:25,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:25,060 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:25,061 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:25,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:25,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1466032852, now seen corresponding path program 91 times [2019-09-08 01:16:25,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:25,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:25,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:25,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:25,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:28,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:28,027 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:16:28,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:28,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-08 01:16:28,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:28,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:28,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-08 01:16:28,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-08 01:16:28,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-08 01:16:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:16:28,312 INFO L87 Difference]: Start difference. First operand 375 states and 557 transitions. Second operand 94 states. [2019-09-08 01:16:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:29,421 INFO L93 Difference]: Finished difference Result 387 states and 573 transitions. [2019-09-08 01:16:29,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-08 01:16:29,421 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 283 [2019-09-08 01:16:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:29,423 INFO L225 Difference]: With dead ends: 387 [2019-09-08 01:16:29,423 INFO L226 Difference]: Without dead ends: 382 [2019-09-08 01:16:29,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 284 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:16:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-08 01:16:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 379. [2019-09-08 01:16:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-09-08 01:16:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 563 transitions. [2019-09-08 01:16:29,428 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 563 transitions. Word has length 283 [2019-09-08 01:16:29,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:29,428 INFO L475 AbstractCegarLoop]: Abstraction has 379 states and 563 transitions. [2019-09-08 01:16:29,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-08 01:16:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 563 transitions. [2019-09-08 01:16:29,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-08 01:16:29,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:29,429 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:29,429 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:29,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:29,430 INFO L82 PathProgramCache]: Analyzing trace with hash 582831473, now seen corresponding path program 92 times [2019-09-08 01:16:29,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:29,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:29,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:29,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:29,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:32,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:32,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 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:16:32,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:32,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:32,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:32,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-08 01:16:32,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:32,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:32,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-08 01:16:32,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-08 01:16:32,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-08 01:16:32,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:16:32,760 INFO L87 Difference]: Start difference. First operand 379 states and 563 transitions. Second operand 95 states. [2019-09-08 01:16:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:33,933 INFO L93 Difference]: Finished difference Result 391 states and 579 transitions. [2019-09-08 01:16:33,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 01:16:33,934 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 286 [2019-09-08 01:16:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:33,937 INFO L225 Difference]: With dead ends: 391 [2019-09-08 01:16:33,937 INFO L226 Difference]: Without dead ends: 386 [2019-09-08 01:16:33,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 287 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:16:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-08 01:16:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2019-09-08 01:16:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-08 01:16:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 569 transitions. [2019-09-08 01:16:33,943 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 569 transitions. Word has length 286 [2019-09-08 01:16:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:33,943 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 569 transitions. [2019-09-08 01:16:33,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-08 01:16:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 569 transitions. [2019-09-08 01:16:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 01:16:33,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:33,944 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:33,944 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:33,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:33,945 INFO L82 PathProgramCache]: Analyzing trace with hash 100204980, now seen corresponding path program 93 times [2019-09-08 01:16:33,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:33,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:33,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:33,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:33,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:37,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:37,044 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:16:37,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:37,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-09-08 01:16:37,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:37,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-08 01:16:37,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:37,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:37,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-08 01:16:37,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-08 01:16:37,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-08 01:16:37,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 01:16:37,510 INFO L87 Difference]: Start difference. First operand 383 states and 569 transitions. Second operand 96 states. [2019-09-08 01:16:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:38,684 INFO L93 Difference]: Finished difference Result 395 states and 585 transitions. [2019-09-08 01:16:38,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-08 01:16:38,685 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 289 [2019-09-08 01:16:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:38,687 INFO L225 Difference]: With dead ends: 395 [2019-09-08 01:16:38,688 INFO L226 Difference]: Without dead ends: 390 [2019-09-08 01:16:38,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 290 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:16:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-09-08 01:16:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2019-09-08 01:16:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-09-08 01:16:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 575 transitions. [2019-09-08 01:16:38,693 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 575 transitions. Word has length 289 [2019-09-08 01:16:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:38,694 INFO L475 AbstractCegarLoop]: Abstraction has 387 states and 575 transitions. [2019-09-08 01:16:38,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-08 01:16:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 575 transitions. [2019-09-08 01:16:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 01:16:38,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:38,695 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:38,695 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:38,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1724859025, now seen corresponding path program 94 times [2019-09-08 01:16:38,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:38,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:38,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:41,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:41,859 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:16:41,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:42,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:42,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:42,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-08 01:16:42,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:42,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:42,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-08 01:16:42,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-08 01:16:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-08 01:16:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:16:42,186 INFO L87 Difference]: Start difference. First operand 387 states and 575 transitions. Second operand 97 states. [2019-09-08 01:16:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:43,153 INFO L93 Difference]: Finished difference Result 399 states and 591 transitions. [2019-09-08 01:16:43,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-08 01:16:43,153 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 292 [2019-09-08 01:16:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:43,155 INFO L225 Difference]: With dead ends: 399 [2019-09-08 01:16:43,155 INFO L226 Difference]: Without dead ends: 394 [2019-09-08 01:16:43,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:16:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-08 01:16:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-09-08 01:16:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-08 01:16:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 581 transitions. [2019-09-08 01:16:43,161 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 581 transitions. Word has length 292 [2019-09-08 01:16:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:43,161 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 581 transitions. [2019-09-08 01:16:43,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-08 01:16:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 581 transitions. [2019-09-08 01:16:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 01:16:43,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:43,163 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:43,163 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:43,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1807054996, now seen corresponding path program 95 times [2019-09-08 01:16:43,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:43,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:43,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13490 backedges. 0 proven. 13490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:46,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:46,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 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:16:46,392 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:46,778 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-09-08 01:16:46,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:46,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-08 01:16:46,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13490 backedges. 0 proven. 13490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:46,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:46,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-08 01:16:46,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-08 01:16:46,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-08 01:16:46,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:16:46,854 INFO L87 Difference]: Start difference. First operand 391 states and 581 transitions. Second operand 98 states. [2019-09-08 01:16:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:48,257 INFO L93 Difference]: Finished difference Result 403 states and 597 transitions. [2019-09-08 01:16:48,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-08 01:16:48,258 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 295 [2019-09-08 01:16:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:48,259 INFO L225 Difference]: With dead ends: 403 [2019-09-08 01:16:48,260 INFO L226 Difference]: Without dead ends: 398 [2019-09-08 01:16:48,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:16:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-09-08 01:16:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2019-09-08 01:16:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-08 01:16:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 587 transitions. [2019-09-08 01:16:48,264 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 587 transitions. Word has length 295 [2019-09-08 01:16:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:48,264 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 587 transitions. [2019-09-08 01:16:48,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-08 01:16:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 587 transitions. [2019-09-08 01:16:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 01:16:48,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:48,266 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:48,266 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1919098959, now seen corresponding path program 96 times [2019-09-08 01:16:48,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:48,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:48,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 13776 backedges. 0 proven. 13776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:51,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:51,710 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:16:51,722 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:16:52,138 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-09-08 01:16:52,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:52,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-08 01:16:52,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13776 backedges. 0 proven. 13776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:52,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:52,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-08 01:16:52,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-08 01:16:52,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-08 01:16:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:16:52,219 INFO L87 Difference]: Start difference. First operand 395 states and 587 transitions. Second operand 99 states. [2019-09-08 01:16:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:53,390 INFO L93 Difference]: Finished difference Result 407 states and 603 transitions. [2019-09-08 01:16:53,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-08 01:16:53,391 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 298 [2019-09-08 01:16:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:53,392 INFO L225 Difference]: With dead ends: 407 [2019-09-08 01:16:53,392 INFO L226 Difference]: Without dead ends: 402 [2019-09-08 01:16:53,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:16:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-08 01:16:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 399. [2019-09-08 01:16:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-08 01:16:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 593 transitions. [2019-09-08 01:16:53,397 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 593 transitions. Word has length 298 [2019-09-08 01:16:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:53,398 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 593 transitions. [2019-09-08 01:16:53,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-08 01:16:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 593 transitions. [2019-09-08 01:16:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 01:16:53,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:53,399 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:53,399 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:53,399 INFO L82 PathProgramCache]: Analyzing trace with hash -46839948, now seen corresponding path program 97 times [2019-09-08 01:16:53,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:53,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:53,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14065 backedges. 0 proven. 14065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:56,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:56,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 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:16:56,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:56,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-08 01:16:56,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 14065 backedges. 0 proven. 14065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:57,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:57,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-08 01:16:57,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-08 01:16:57,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-08 01:16:57,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:16:57,043 INFO L87 Difference]: Start difference. First operand 399 states and 593 transitions. Second operand 100 states. [2019-09-08 01:16:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:58,778 INFO L93 Difference]: Finished difference Result 411 states and 609 transitions. [2019-09-08 01:16:58,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-08 01:16:58,778 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 301 [2019-09-08 01:16:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:58,780 INFO L225 Difference]: With dead ends: 411 [2019-09-08 01:16:58,780 INFO L226 Difference]: Without dead ends: 406 [2019-09-08 01:16:58,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:16:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-08 01:16:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2019-09-08 01:16:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-08 01:16:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 599 transitions. [2019-09-08 01:16:58,786 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 599 transitions. Word has length 301 [2019-09-08 01:16:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:58,786 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 599 transitions. [2019-09-08 01:16:58,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-08 01:16:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 599 transitions. [2019-09-08 01:16:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 01:16:58,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:58,787 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:58,788 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1976050897, now seen corresponding path program 98 times [2019-09-08 01:16:58,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:58,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:58,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 14357 backedges. 0 proven. 14357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:02,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:02,242 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:17:02,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:17:02,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:17:02,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:02,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1394 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-08 01:17:02,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14357 backedges. 0 proven. 14357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:02,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:02,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-08 01:17:02,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-08 01:17:02,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-08 01:17:02,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:17:02,554 INFO L87 Difference]: Start difference. First operand 403 states and 599 transitions. Second operand 101 states. [2019-09-08 01:17:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:04,385 INFO L93 Difference]: Finished difference Result 415 states and 615 transitions. [2019-09-08 01:17:04,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 01:17:04,385 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 304 [2019-09-08 01:17:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:04,387 INFO L225 Difference]: With dead ends: 415 [2019-09-08 01:17:04,387 INFO L226 Difference]: Without dead ends: 410 [2019-09-08 01:17:04,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:17:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-08 01:17:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2019-09-08 01:17:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-08 01:17:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 605 transitions. [2019-09-08 01:17:04,391 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 605 transitions. Word has length 304 [2019-09-08 01:17:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:04,392 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 605 transitions. [2019-09-08 01:17:04,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-08 01:17:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 605 transitions. [2019-09-08 01:17:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 01:17:04,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:04,393 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:04,393 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1063883180, now seen corresponding path program 99 times [2019-09-08 01:17:04,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:04,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:04,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:04,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:04,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14652 backedges. 0 proven. 14652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:08,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:08,074 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:17:08,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:17:08,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-09-08 01:17:08,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:08,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-08 01:17:08,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14652 backedges. 0 proven. 14652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:08,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:08,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-08 01:17:08,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-08 01:17:08,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-08 01:17:08,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 01:17:08,590 INFO L87 Difference]: Start difference. First operand 407 states and 605 transitions. Second operand 102 states. [2019-09-08 01:17:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:10,361 INFO L93 Difference]: Finished difference Result 419 states and 621 transitions. [2019-09-08 01:17:10,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-08 01:17:10,362 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 307 [2019-09-08 01:17:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:10,364 INFO L225 Difference]: With dead ends: 419 [2019-09-08 01:17:10,364 INFO L226 Difference]: Without dead ends: 414 [2019-09-08 01:17:10,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 01:17:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-09-08 01:17:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-09-08 01:17:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-08 01:17:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 611 transitions. [2019-09-08 01:17:10,371 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 611 transitions. Word has length 307 [2019-09-08 01:17:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:10,371 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 611 transitions. [2019-09-08 01:17:10,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-08 01:17:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 611 transitions. [2019-09-08 01:17:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 01:17:10,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:10,373 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:10,374 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:10,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:10,374 INFO L82 PathProgramCache]: Analyzing trace with hash -59567631, now seen corresponding path program 100 times [2019-09-08 01:17:10,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:10,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:10,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14950 backedges. 0 proven. 14950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:14,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:14,051 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:17:14,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:17:14,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:17:14,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:14,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-08 01:17:14,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14950 backedges. 0 proven. 14950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:14,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:14,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2019-09-08 01:17:14,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-08 01:17:14,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-08 01:17:14,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 01:17:14,364 INFO L87 Difference]: Start difference. First operand 411 states and 611 transitions. Second operand 103 states. [2019-09-08 01:17:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:16,349 INFO L93 Difference]: Finished difference Result 423 states and 627 transitions. [2019-09-08 01:17:16,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-08 01:17:16,349 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 310 [2019-09-08 01:17:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:16,351 INFO L225 Difference]: With dead ends: 423 [2019-09-08 01:17:16,351 INFO L226 Difference]: Without dead ends: 418 [2019-09-08 01:17:16,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 01:17:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-09-08 01:17:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 415. [2019-09-08 01:17:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-08 01:17:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 617 transitions. [2019-09-08 01:17:16,357 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 617 transitions. Word has length 310 [2019-09-08 01:17:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:16,358 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 617 transitions. [2019-09-08 01:17:16,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-08 01:17:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 617 transitions. [2019-09-08 01:17:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 01:17:16,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:16,360 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:16,360 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:16,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:16,360 INFO L82 PathProgramCache]: Analyzing trace with hash 762768692, now seen corresponding path program 101 times [2019-09-08 01:17:16,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:16,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:16,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:16,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:16,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 15251 backedges. 0 proven. 15251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:20,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:20,052 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:17:20,063 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:17:20,502 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2019-09-08 01:17:20,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:20,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-08 01:17:20,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15251 backedges. 0 proven. 15251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:20,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:20,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2019-09-08 01:17:20,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-08 01:17:20,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-08 01:17:20,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-08 01:17:20,604 INFO L87 Difference]: Start difference. First operand 415 states and 617 transitions. Second operand 104 states. [2019-09-08 01:17:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:21,751 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2019-09-08 01:17:21,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-08 01:17:21,751 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 313 [2019-09-08 01:17:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:21,753 INFO L225 Difference]: With dead ends: 427 [2019-09-08 01:17:21,753 INFO L226 Difference]: Without dead ends: 422 [2019-09-08 01:17:21,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 314 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:17:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-08 01:17:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 419. [2019-09-08 01:17:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-08 01:17:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 623 transitions. [2019-09-08 01:17:21,758 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 623 transitions. Word has length 313 [2019-09-08 01:17:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:21,759 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 623 transitions. [2019-09-08 01:17:21,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-08 01:17:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 623 transitions. [2019-09-08 01:17:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 01:17:21,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:21,760 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:21,760 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:21,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:21,761 INFO L82 PathProgramCache]: Analyzing trace with hash 490710801, now seen corresponding path program 102 times [2019-09-08 01:17:21,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:21,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:21,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:21,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:21,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 0 proven. 15555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:25,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:25,455 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:17:25,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:17:25,895 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2019-09-08 01:17:25,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:25,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-08 01:17:25,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 0 proven. 15555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:25,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:25,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2019-09-08 01:17:25,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-08 01:17:25,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-08 01:17:25,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-09-08 01:17:25,979 INFO L87 Difference]: Start difference. First operand 419 states and 623 transitions. Second operand 105 states. [2019-09-08 01:17:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:27,660 INFO L93 Difference]: Finished difference Result 431 states and 639 transitions. [2019-09-08 01:17:27,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-08 01:17:27,661 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 316 [2019-09-08 01:17:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:27,662 INFO L225 Difference]: With dead ends: 431 [2019-09-08 01:17:27,662 INFO L226 Difference]: Without dead ends: 426 [2019-09-08 01:17:27,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 317 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:17:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-09-08 01:17:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2019-09-08 01:17:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-08 01:17:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 629 transitions. [2019-09-08 01:17:27,669 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 629 transitions. Word has length 316 [2019-09-08 01:17:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:27,669 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 629 transitions. [2019-09-08 01:17:27,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-08 01:17:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 629 transitions. [2019-09-08 01:17:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 01:17:27,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:27,671 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:27,671 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:27,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:27,672 INFO L82 PathProgramCache]: Analyzing trace with hash 217367572, now seen corresponding path program 103 times [2019-09-08 01:17:27,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:27,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:27,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:27,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15862 backedges. 0 proven. 15862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:31,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:31,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 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:17:31,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:31,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1464 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-08 01:17:31,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15862 backedges. 0 proven. 15862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:31,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:31,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2019-09-08 01:17:31,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-08 01:17:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-08 01:17:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 01:17:31,870 INFO L87 Difference]: Start difference. First operand 423 states and 629 transitions. Second operand 106 states. [2019-09-08 01:17:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:33,334 INFO L93 Difference]: Finished difference Result 435 states and 645 transitions. [2019-09-08 01:17:33,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-08 01:17:33,335 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 319 [2019-09-08 01:17:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:33,336 INFO L225 Difference]: With dead ends: 435 [2019-09-08 01:17:33,336 INFO L226 Difference]: Without dead ends: 430 [2019-09-08 01:17:33,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 320 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:17:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-08 01:17:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2019-09-08 01:17:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 01:17:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 635 transitions. [2019-09-08 01:17:33,341 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 635 transitions. Word has length 319 [2019-09-08 01:17:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:33,342 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 635 transitions. [2019-09-08 01:17:33,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-08 01:17:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 635 transitions. [2019-09-08 01:17:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 01:17:33,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:33,347 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:33,347 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:33,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:33,347 INFO L82 PathProgramCache]: Analyzing trace with hash 307225649, now seen corresponding path program 104 times [2019-09-08 01:17:33,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:33,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:33,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:33,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:33,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16172 backedges. 0 proven. 16172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:37,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:37,202 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:17:37,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:17:37,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:17:37,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:37,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 1478 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-08 01:17:37,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 16172 backedges. 0 proven. 16172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:37,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:37,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2019-09-08 01:17:37,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-08 01:17:37,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-08 01:17:37,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-08 01:17:37,566 INFO L87 Difference]: Start difference. First operand 427 states and 635 transitions. Second operand 107 states. [2019-09-08 01:17:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:39,543 INFO L93 Difference]: Finished difference Result 439 states and 651 transitions. [2019-09-08 01:17:39,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-08 01:17:39,543 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 322 [2019-09-08 01:17:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:39,545 INFO L225 Difference]: With dead ends: 439 [2019-09-08 01:17:39,545 INFO L226 Difference]: Without dead ends: 434 [2019-09-08 01:17:39,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-08 01:17:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-09-08 01:17:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2019-09-08 01:17:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-08 01:17:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 641 transitions. [2019-09-08 01:17:39,551 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 641 transitions. Word has length 322 [2019-09-08 01:17:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:39,551 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 641 transitions. [2019-09-08 01:17:39,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-08 01:17:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 641 transitions. [2019-09-08 01:17:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 01:17:39,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:39,553 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:39,553 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:39,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:39,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1504572148, now seen corresponding path program 105 times [2019-09-08 01:17:39,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:39,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:39,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:39,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:39,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16485 backedges. 0 proven. 16485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:43,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:43,487 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:17:43,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:17:43,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2019-09-08 01:17:43,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:43,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-08 01:17:44,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 16485 backedges. 0 proven. 16485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:44,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:44,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2019-09-08 01:17:44,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-08 01:17:44,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-08 01:17:44,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-08 01:17:44,081 INFO L87 Difference]: Start difference. First operand 431 states and 641 transitions. Second operand 108 states. [2019-09-08 01:17:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:46,121 INFO L93 Difference]: Finished difference Result 443 states and 657 transitions. [2019-09-08 01:17:46,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-08 01:17:46,121 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 325 [2019-09-08 01:17:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:46,122 INFO L225 Difference]: With dead ends: 443 [2019-09-08 01:17:46,122 INFO L226 Difference]: Without dead ends: 438 [2019-09-08 01:17:46,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-08 01:17:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-09-08 01:17:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2019-09-08 01:17:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-08 01:17:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 647 transitions. [2019-09-08 01:17:46,127 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 647 transitions. Word has length 325 [2019-09-08 01:17:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:46,127 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 647 transitions. [2019-09-08 01:17:46,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-08 01:17:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 647 transitions. [2019-09-08 01:17:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 01:17:46,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:46,129 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:46,129 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1950730577, now seen corresponding path program 106 times [2019-09-08 01:17:46,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:46,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:46,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:46,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16801 backedges. 0 proven. 16801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:50,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:50,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:50,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:17:50,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:17:50,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:50,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-08 01:17:50,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16801 backedges. 0 proven. 16801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:50,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:50,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2019-09-08 01:17:50,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-08 01:17:50,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-08 01:17:50,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 01:17:50,657 INFO L87 Difference]: Start difference. First operand 435 states and 647 transitions. Second operand 109 states. [2019-09-08 01:17:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:52,439 INFO L93 Difference]: Finished difference Result 447 states and 663 transitions. [2019-09-08 01:17:52,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-08 01:17:52,439 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 328 [2019-09-08 01:17:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:52,440 INFO L225 Difference]: With dead ends: 447 [2019-09-08 01:17:52,441 INFO L226 Difference]: Without dead ends: 442 [2019-09-08 01:17:52,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 01:17:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-08 01:17:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 439. [2019-09-08 01:17:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-08 01:17:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 653 transitions. [2019-09-08 01:17:52,445 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 653 transitions. Word has length 328 [2019-09-08 01:17:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:52,446 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 653 transitions. [2019-09-08 01:17:52,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-08 01:17:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 653 transitions. [2019-09-08 01:17:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 01:17:52,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:52,447 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:52,447 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash 532707796, now seen corresponding path program 107 times [2019-09-08 01:17:52,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:52,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:52,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17120 backedges. 0 proven. 17120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:56,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:56,552 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:17:56,562 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:17:57,042 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2019-09-08 01:17:57,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:57,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-08 01:17:57,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 17120 backedges. 0 proven. 17120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:57,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:57,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2019-09-08 01:17:57,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-08 01:17:57,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-08 01:17:57,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 01:17:57,161 INFO L87 Difference]: Start difference. First operand 439 states and 653 transitions. Second operand 110 states. [2019-09-08 01:17:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:58,682 INFO L93 Difference]: Finished difference Result 451 states and 669 transitions. [2019-09-08 01:17:58,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-08 01:17:58,683 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 331 [2019-09-08 01:17:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:58,684 INFO L225 Difference]: With dead ends: 451 [2019-09-08 01:17:58,684 INFO L226 Difference]: Without dead ends: 446 [2019-09-08 01:17:58,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 01:17:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-08 01:17:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 443. [2019-09-08 01:17:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-09-08 01:17:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 659 transitions. [2019-09-08 01:17:58,688 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 659 transitions. Word has length 331 [2019-09-08 01:17:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:58,688 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 659 transitions. [2019-09-08 01:17:58,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-08 01:17:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 659 transitions. [2019-09-08 01:17:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 01:17:58,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:58,689 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:58,689 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1514362481, now seen corresponding path program 108 times [2019-09-08 01:17:58,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:58,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:58,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:58,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:58,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 17442 backedges. 0 proven. 17442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:02,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:02,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 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:18:02,972 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:18:03,439 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2019-09-08 01:18:03,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:03,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 1534 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-08 01:18:03,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 17442 backedges. 0 proven. 17442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:03,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:03,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2019-09-08 01:18:03,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-08 01:18:03,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-08 01:18:03,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-09-08 01:18:03,530 INFO L87 Difference]: Start difference. First operand 443 states and 659 transitions. Second operand 111 states. [2019-09-08 01:18:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:05,395 INFO L93 Difference]: Finished difference Result 455 states and 675 transitions. [2019-09-08 01:18:05,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-08 01:18:05,395 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 334 [2019-09-08 01:18:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:05,396 INFO L225 Difference]: With dead ends: 455 [2019-09-08 01:18:05,396 INFO L226 Difference]: Without dead ends: 450 [2019-09-08 01:18:05,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 335 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:18:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-08 01:18:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2019-09-08 01:18:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-08 01:18:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 665 transitions. [2019-09-08 01:18:05,401 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 665 transitions. Word has length 334 [2019-09-08 01:18:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:05,401 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 665 transitions. [2019-09-08 01:18:05,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-08 01:18:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 665 transitions. [2019-09-08 01:18:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 01:18:05,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:05,402 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:05,402 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:05,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1556764852, now seen corresponding path program 109 times [2019-09-08 01:18:05,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:05,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:05,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:05,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:05,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 17767 backedges. 0 proven. 17767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:09,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:09,776 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:18:09,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:10,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 1548 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-08 01:18:10,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17767 backedges. 0 proven. 17767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:10,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:10,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2019-09-08 01:18:10,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-08 01:18:10,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-08 01:18:10,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-08 01:18:10,119 INFO L87 Difference]: Start difference. First operand 447 states and 665 transitions. Second operand 112 states. [2019-09-08 01:18:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:11,691 INFO L93 Difference]: Finished difference Result 459 states and 681 transitions. [2019-09-08 01:18:11,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-08 01:18:11,691 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 337 [2019-09-08 01:18:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:11,692 INFO L225 Difference]: With dead ends: 459 [2019-09-08 01:18:11,692 INFO L226 Difference]: Without dead ends: 454 [2019-09-08 01:18:11,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 338 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:18:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-08 01:18:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2019-09-08 01:18:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-09-08 01:18:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 671 transitions. [2019-09-08 01:18:11,697 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 671 transitions. Word has length 337 [2019-09-08 01:18:11,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:11,697 INFO L475 AbstractCegarLoop]: Abstraction has 451 states and 671 transitions. [2019-09-08 01:18:11,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-08 01:18:11,697 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 671 transitions. [2019-09-08 01:18:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 01:18:11,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:11,698 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:11,698 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:11,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2045414289, now seen corresponding path program 110 times [2019-09-08 01:18:11,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:11,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:11,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:11,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:11,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:16,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:16,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 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:18:16,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:18:16,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:18:16,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:16,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-08 01:18:16,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:16,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:16,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2019-09-08 01:18:16,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-08 01:18:16,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-08 01:18:16,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-08 01:18:16,425 INFO L87 Difference]: Start difference. First operand 451 states and 671 transitions. Second operand 113 states. [2019-09-08 01:18:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:18,947 INFO L93 Difference]: Finished difference Result 463 states and 687 transitions. [2019-09-08 01:18:18,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-08 01:18:18,947 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 340 [2019-09-08 01:18:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:18,948 INFO L225 Difference]: With dead ends: 463 [2019-09-08 01:18:18,948 INFO L226 Difference]: Without dead ends: 458 [2019-09-08 01:18:18,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-08 01:18:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-08 01:18:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 455. [2019-09-08 01:18:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-08 01:18:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 677 transitions. [2019-09-08 01:18:18,952 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 677 transitions. Word has length 340 [2019-09-08 01:18:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:18,953 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 677 transitions. [2019-09-08 01:18:18,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-08 01:18:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 677 transitions. [2019-09-08 01:18:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 01:18:18,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:18,954 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:18,954 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:18,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:18,954 INFO L82 PathProgramCache]: Analyzing trace with hash -538341484, now seen corresponding path program 111 times [2019-09-08 01:18:18,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:18,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:18,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:18,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:18,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18426 backedges. 0 proven. 18426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:23,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:23,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:18:23,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:18:23,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2019-09-08 01:18:23,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:23,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-08 01:18:23,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18426 backedges. 0 proven. 18426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:24,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:24,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2019-09-08 01:18:24,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-08 01:18:24,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-08 01:18:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-08 01:18:24,056 INFO L87 Difference]: Start difference. First operand 455 states and 677 transitions. Second operand 114 states. [2019-09-08 01:18:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:26,849 INFO L93 Difference]: Finished difference Result 467 states and 693 transitions. [2019-09-08 01:18:26,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-08 01:18:26,850 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 343 [2019-09-08 01:18:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:26,852 INFO L225 Difference]: With dead ends: 467 [2019-09-08 01:18:26,852 INFO L226 Difference]: Without dead ends: 462 [2019-09-08 01:18:26,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-08 01:18:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-08 01:18:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2019-09-08 01:18:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-09-08 01:18:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 683 transitions. [2019-09-08 01:18:26,858 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 683 transitions. Word has length 343 [2019-09-08 01:18:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:26,858 INFO L475 AbstractCegarLoop]: Abstraction has 459 states and 683 transitions. [2019-09-08 01:18:26,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-08 01:18:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 683 transitions. [2019-09-08 01:18:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-08 01:18:26,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:26,860 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:26,860 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1197303985, now seen corresponding path program 112 times [2019-09-08 01:18:26,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:26,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:26,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 18760 backedges. 0 proven. 18760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:31,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:31,597 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:18:31,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:18:31,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:18:31,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:31,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1590 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-08 01:18:31,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18760 backedges. 0 proven. 18760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:31,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:31,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2019-09-08 01:18:31,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-08 01:18:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-08 01:18:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 01:18:31,950 INFO L87 Difference]: Start difference. First operand 459 states and 683 transitions. Second operand 115 states. [2019-09-08 01:18:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:34,776 INFO L93 Difference]: Finished difference Result 471 states and 699 transitions. [2019-09-08 01:18:34,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-08 01:18:34,776 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 346 [2019-09-08 01:18:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:34,777 INFO L225 Difference]: With dead ends: 471 [2019-09-08 01:18:34,777 INFO L226 Difference]: Without dead ends: 466 [2019-09-08 01:18:34,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 01:18:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-08 01:18:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 463. [2019-09-08 01:18:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-08 01:18:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 689 transitions. [2019-09-08 01:18:34,782 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 689 transitions. Word has length 346 [2019-09-08 01:18:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:34,782 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 689 transitions. [2019-09-08 01:18:34,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-08 01:18:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 689 transitions. [2019-09-08 01:18:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-08 01:18:34,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:34,783 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:34,783 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:34,784 INFO L82 PathProgramCache]: Analyzing trace with hash 700194420, now seen corresponding path program 113 times [2019-09-08 01:18:34,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:34,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:34,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:34,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:34,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 19097 backedges. 0 proven. 19097 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:39,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:39,344 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:18:39,354 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:18:39,874 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2019-09-08 01:18:39,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:39,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-08 01:18:39,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 19097 backedges. 0 proven. 19097 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:39,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:39,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2019-09-08 01:18:39,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-08 01:18:39,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-08 01:18:39,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-08 01:18:39,981 INFO L87 Difference]: Start difference. First operand 463 states and 689 transitions. Second operand 116 states. [2019-09-08 01:18:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:42,530 INFO L93 Difference]: Finished difference Result 475 states and 705 transitions. [2019-09-08 01:18:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-08 01:18:42,531 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 349 [2019-09-08 01:18:42,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:42,532 INFO L225 Difference]: With dead ends: 475 [2019-09-08 01:18:42,532 INFO L226 Difference]: Without dead ends: 470 [2019-09-08 01:18:42,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-08 01:18:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-08 01:18:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 467. [2019-09-08 01:18:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-09-08 01:18:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 695 transitions. [2019-09-08 01:18:42,537 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 695 transitions. Word has length 349 [2019-09-08 01:18:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:42,537 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 695 transitions. [2019-09-08 01:18:42,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-08 01:18:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 695 transitions. [2019-09-08 01:18:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 01:18:42,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:42,539 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:42,539 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:42,539 INFO L82 PathProgramCache]: Analyzing trace with hash 356380113, now seen corresponding path program 114 times [2019-09-08 01:18:42,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:42,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:42,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:42,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:42,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19437 backedges. 0 proven. 19437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:47,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:47,161 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:18:47,170 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:18:47,683 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2019-09-08 01:18:47,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:47,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-08 01:18:47,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19437 backedges. 0 proven. 19437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:47,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:47,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2019-09-08 01:18:47,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-08 01:18:47,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-08 01:18:47,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 01:18:47,782 INFO L87 Difference]: Start difference. First operand 467 states and 695 transitions. Second operand 117 states. [2019-09-08 01:18:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:49,518 INFO L93 Difference]: Finished difference Result 479 states and 711 transitions. [2019-09-08 01:18:49,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-08 01:18:49,518 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 352 [2019-09-08 01:18:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:49,520 INFO L225 Difference]: With dead ends: 479 [2019-09-08 01:18:49,520 INFO L226 Difference]: Without dead ends: 474 [2019-09-08 01:18:49,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 01:18:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-08 01:18:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 471. [2019-09-08 01:18:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-09-08 01:18:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 701 transitions. [2019-09-08 01:18:49,525 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 701 transitions. Word has length 352 [2019-09-08 01:18:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:49,525 INFO L475 AbstractCegarLoop]: Abstraction has 471 states and 701 transitions. [2019-09-08 01:18:49,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-08 01:18:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 701 transitions. [2019-09-08 01:18:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-08 01:18:49,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:49,527 INFO L399 BasicCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:49,527 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1281361236, now seen corresponding path program 115 times [2019-09-08 01:18:49,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:49,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:49,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:49,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:49,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 19780 backedges. 0 proven. 19780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:54,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:54,254 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:18:54,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:54,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-08 01:18:54,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 19780 backedges. 0 proven. 19780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:54,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:54,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2019-09-08 01:18:54,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-08 01:18:54,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-08 01:18:54,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 01:18:54,642 INFO L87 Difference]: Start difference. First operand 471 states and 701 transitions. Second operand 118 states. [2019-09-08 01:18:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:57,379 INFO L93 Difference]: Finished difference Result 483 states and 717 transitions. [2019-09-08 01:18:57,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-08 01:18:57,379 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 355 [2019-09-08 01:18:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:57,380 INFO L225 Difference]: With dead ends: 483 [2019-09-08 01:18:57,380 INFO L226 Difference]: Without dead ends: 478 [2019-09-08 01:18:57,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 01:18:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-08 01:18:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 475. [2019-09-08 01:18:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-09-08 01:18:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 707 transitions. [2019-09-08 01:18:57,385 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 707 transitions. Word has length 355 [2019-09-08 01:18:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:57,385 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 707 transitions. [2019-09-08 01:18:57,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-08 01:18:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 707 transitions. [2019-09-08 01:18:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-08 01:18:57,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:57,386 INFO L399 BasicCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:57,386 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:57,387 INFO L82 PathProgramCache]: Analyzing trace with hash 883825393, now seen corresponding path program 116 times [2019-09-08 01:18:57,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:57,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:57,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20126 backedges. 0 proven. 20126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:02,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:02,170 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:19:02,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:19:02,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:19:02,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:02,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1646 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-08 01:19:02,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20126 backedges. 0 proven. 20126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:02,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:02,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2019-09-08 01:19:02,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-08 01:19:02,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-08 01:19:02,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-08 01:19:02,544 INFO L87 Difference]: Start difference. First operand 475 states and 707 transitions. Second operand 119 states. [2019-09-08 01:19:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:04,823 INFO L93 Difference]: Finished difference Result 487 states and 723 transitions. [2019-09-08 01:19:04,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-08 01:19:04,824 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 358 [2019-09-08 01:19:04,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:04,825 INFO L225 Difference]: With dead ends: 487 [2019-09-08 01:19:04,825 INFO L226 Difference]: Without dead ends: 482 [2019-09-08 01:19:04,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-08 01:19:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-08 01:19:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 479. [2019-09-08 01:19:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-08 01:19:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 713 transitions. [2019-09-08 01:19:04,858 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 713 transitions. Word has length 358 [2019-09-08 01:19:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:04,858 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 713 transitions. [2019-09-08 01:19:04,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-08 01:19:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 713 transitions. [2019-09-08 01:19:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-09-08 01:19:04,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:04,862 INFO L399 BasicCegarLoop]: trace histogram [117, 117, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:04,862 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:04,863 INFO L82 PathProgramCache]: Analyzing trace with hash -881638348, now seen corresponding path program 117 times [2019-09-08 01:19:04,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:04,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:04,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:04,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:04,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20475 backedges. 0 proven. 20475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:09,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:09,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 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:19:09,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:19:10,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 118 check-sat command(s) [2019-09-08 01:19:10,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:10,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 1660 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-08 01:19:10,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 20475 backedges. 0 proven. 20475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:10,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:10,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2019-09-08 01:19:10,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-08 01:19:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-08 01:19:10,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-08 01:19:10,431 INFO L87 Difference]: Start difference. First operand 479 states and 713 transitions. Second operand 120 states. [2019-09-08 01:19:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:12,274 INFO L93 Difference]: Finished difference Result 491 states and 729 transitions. [2019-09-08 01:19:12,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-08 01:19:12,275 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 361 [2019-09-08 01:19:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:12,276 INFO L225 Difference]: With dead ends: 491 [2019-09-08 01:19:12,276 INFO L226 Difference]: Without dead ends: 486 [2019-09-08 01:19:12,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-08 01:19:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-09-08 01:19:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 483. [2019-09-08 01:19:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-08 01:19:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 719 transitions. [2019-09-08 01:19:12,281 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 719 transitions. Word has length 361 [2019-09-08 01:19:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:12,281 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 719 transitions. [2019-09-08 01:19:12,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-08 01:19:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 719 transitions. [2019-09-08 01:19:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-08 01:19:12,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:12,282 INFO L399 BasicCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:12,283 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:12,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:12,283 INFO L82 PathProgramCache]: Analyzing trace with hash 357560337, now seen corresponding path program 118 times [2019-09-08 01:19:12,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:12,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:12,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:12,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:12,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 0 proven. 20827 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:17,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:17,269 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:19:17,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:19:17,562 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:19:17,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:17,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-08 01:19:17,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 0 proven. 20827 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:17,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:17,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2019-09-08 01:19:17,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-08 01:19:17,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-08 01:19:17,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-08 01:19:17,666 INFO L87 Difference]: Start difference. First operand 483 states and 719 transitions. Second operand 121 states. [2019-09-08 01:19:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:20,417 INFO L93 Difference]: Finished difference Result 495 states and 735 transitions. [2019-09-08 01:19:20,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-08 01:19:20,417 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 364 [2019-09-08 01:19:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:20,418 INFO L225 Difference]: With dead ends: 495 [2019-09-08 01:19:20,418 INFO L226 Difference]: Without dead ends: 490 [2019-09-08 01:19:20,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-08 01:19:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-08 01:19:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 487. [2019-09-08 01:19:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-08 01:19:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 725 transitions. [2019-09-08 01:19:20,423 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 725 transitions. Word has length 364 [2019-09-08 01:19:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:20,423 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 725 transitions. [2019-09-08 01:19:20,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-08 01:19:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 725 transitions. [2019-09-08 01:19:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-08 01:19:20,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:20,424 INFO L399 BasicCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:20,424 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:20,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:20,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2081676052, now seen corresponding path program 119 times [2019-09-08 01:19:20,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:20,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:20,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:20,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:20,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 21182 backedges. 0 proven. 21182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:25,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:25,472 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:19:25,483 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:19:26,021 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 120 check-sat command(s) [2019-09-08 01:19:26,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:26,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 1688 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-08 01:19:26,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21182 backedges. 0 proven. 21182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:26,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:26,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 122 [2019-09-08 01:19:26,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-08 01:19:26,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-08 01:19:26,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-08 01:19:26,132 INFO L87 Difference]: Start difference. First operand 487 states and 725 transitions. Second operand 122 states. [2019-09-08 01:19:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:28,095 INFO L93 Difference]: Finished difference Result 499 states and 741 transitions. [2019-09-08 01:19:28,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-08 01:19:28,095 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 367 [2019-09-08 01:19:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:28,097 INFO L225 Difference]: With dead ends: 499 [2019-09-08 01:19:28,097 INFO L226 Difference]: Without dead ends: 494 [2019-09-08 01:19:28,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-08 01:19:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-08 01:19:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 491. [2019-09-08 01:19:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-09-08 01:19:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 731 transitions. [2019-09-08 01:19:28,104 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 731 transitions. Word has length 367 [2019-09-08 01:19:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:28,104 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 731 transitions. [2019-09-08 01:19:28,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-08 01:19:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 731 transitions. [2019-09-08 01:19:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-08 01:19:28,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:28,106 INFO L399 BasicCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:28,106 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:28,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1699048753, now seen corresponding path program 120 times [2019-09-08 01:19:28,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:28,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:28,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:28,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:28,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 21540 backedges. 0 proven. 21540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:33,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:33,209 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:19:33,219 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:19:33,767 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 121 check-sat command(s) [2019-09-08 01:19:33,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:33,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1702 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-08 01:19:33,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 21540 backedges. 0 proven. 21540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:33,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:33,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2019-09-08 01:19:33,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-08 01:19:33,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-08 01:19:33,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-08 01:19:33,881 INFO L87 Difference]: Start difference. First operand 491 states and 731 transitions. Second operand 123 states. [2019-09-08 01:19:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:36,664 INFO L93 Difference]: Finished difference Result 503 states and 747 transitions. [2019-09-08 01:19:36,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-08 01:19:36,664 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 370 [2019-09-08 01:19:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:36,666 INFO L225 Difference]: With dead ends: 503 [2019-09-08 01:19:36,666 INFO L226 Difference]: Without dead ends: 498 [2019-09-08 01:19:36,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-08 01:19:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-08 01:19:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 495. [2019-09-08 01:19:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 01:19:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 737 transitions. [2019-09-08 01:19:36,671 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 737 transitions. Word has length 370 [2019-09-08 01:19:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:36,671 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 737 transitions. [2019-09-08 01:19:36,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-08 01:19:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 737 transitions. [2019-09-08 01:19:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 01:19:36,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:36,673 INFO L399 BasicCegarLoop]: trace histogram [121, 121, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:36,673 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:36,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1692387828, now seen corresponding path program 121 times [2019-09-08 01:19:36,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:36,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:36,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21901 backedges. 0 proven. 21901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:41,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:41,913 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:19:41,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:19:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:42,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-08 01:19:42,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 21901 backedges. 0 proven. 21901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:42,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 124 [2019-09-08 01:19:42,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-08 01:19:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-08 01:19:42,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-08 01:19:42,322 INFO L87 Difference]: Start difference. First operand 495 states and 737 transitions. Second operand 124 states. [2019-09-08 01:19:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:45,813 INFO L93 Difference]: Finished difference Result 507 states and 753 transitions. [2019-09-08 01:19:45,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-08 01:19:45,813 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 373 [2019-09-08 01:19:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:45,815 INFO L225 Difference]: With dead ends: 507 [2019-09-08 01:19:45,815 INFO L226 Difference]: Without dead ends: 502 [2019-09-08 01:19:45,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-08 01:19:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-08 01:19:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2019-09-08 01:19:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-08 01:19:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 743 transitions. [2019-09-08 01:19:45,822 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 743 transitions. Word has length 373 [2019-09-08 01:19:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:45,822 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 743 transitions. [2019-09-08 01:19:45,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-08 01:19:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 743 transitions. [2019-09-08 01:19:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 01:19:45,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:45,825 INFO L399 BasicCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:45,825 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash 825266769, now seen corresponding path program 122 times [2019-09-08 01:19:45,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:45,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:45,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:19:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22265 backedges. 0 proven. 22265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:51,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:51,042 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:19:51,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:19:51,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:19:51,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:51,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 1730 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-08 01:19:51,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 22265 backedges. 0 proven. 22265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:51,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:51,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2019-09-08 01:19:51,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-08 01:19:51,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-08 01:19:51,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-08 01:19:51,433 INFO L87 Difference]: Start difference. First operand 499 states and 743 transitions. Second operand 125 states. [2019-09-08 01:19:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:54,066 INFO L93 Difference]: Finished difference Result 511 states and 759 transitions. [2019-09-08 01:19:54,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-08 01:19:54,066 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 376 [2019-09-08 01:19:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:54,067 INFO L225 Difference]: With dead ends: 511 [2019-09-08 01:19:54,067 INFO L226 Difference]: Without dead ends: 506 [2019-09-08 01:19:54,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-08 01:19:54,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-08 01:19:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 503. [2019-09-08 01:19:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-08 01:19:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 749 transitions. [2019-09-08 01:19:54,071 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 749 transitions. Word has length 376 [2019-09-08 01:19:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:54,072 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 749 transitions. [2019-09-08 01:19:54,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-08 01:19:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 749 transitions. [2019-09-08 01:19:54,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-09-08 01:19:54,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:54,073 INFO L399 BasicCegarLoop]: trace histogram [123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:54,073 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:54,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1644883756, now seen corresponding path program 123 times [2019-09-08 01:19:54,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:54,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:54,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:54,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:54,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 22632 backedges. 0 proven. 22632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:59,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:59,455 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:19:59,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:20:00,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2019-09-08 01:20:00,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:00,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1744 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-08 01:20:00,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22632 backedges. 0 proven. 22632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:00,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:00,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 126 [2019-09-08 01:20:00,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-08 01:20:00,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-08 01:20:00,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 01:20:00,168 INFO L87 Difference]: Start difference. First operand 503 states and 749 transitions. Second operand 126 states. [2019-09-08 01:20:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:02,326 INFO L93 Difference]: Finished difference Result 515 states and 765 transitions. [2019-09-08 01:20:02,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-08 01:20:02,326 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 379 [2019-09-08 01:20:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:02,327 INFO L225 Difference]: With dead ends: 515 [2019-09-08 01:20:02,327 INFO L226 Difference]: Without dead ends: 510 [2019-09-08 01:20:02,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 01:20:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-08 01:20:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 507. [2019-09-08 01:20:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-09-08 01:20:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 755 transitions. [2019-09-08 01:20:02,332 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 755 transitions. Word has length 379 [2019-09-08 01:20:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:02,332 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 755 transitions. [2019-09-08 01:20:02,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-08 01:20:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 755 transitions. [2019-09-08 01:20:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 01:20:02,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:02,334 INFO L399 BasicCegarLoop]: trace histogram [124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:02,334 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash 70475633, now seen corresponding path program 124 times [2019-09-08 01:20:02,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:02,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:02,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23002 backedges. 0 proven. 23002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:07,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:07,856 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:20:07,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:20:08,146 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:20:08,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:08,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-08 01:20:08,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 23002 backedges. 0 proven. 23002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:08,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:08,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2019-09-08 01:20:08,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-08 01:20:08,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-08 01:20:08,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-08 01:20:08,260 INFO L87 Difference]: Start difference. First operand 507 states and 755 transitions. Second operand 127 states. [2019-09-08 01:20:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:10,417 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2019-09-08 01:20:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-08 01:20:10,418 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 382 [2019-09-08 01:20:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:10,419 INFO L225 Difference]: With dead ends: 519 [2019-09-08 01:20:10,419 INFO L226 Difference]: Without dead ends: 514 [2019-09-08 01:20:10,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-08 01:20:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-08 01:20:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 511. [2019-09-08 01:20:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-08 01:20:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 761 transitions. [2019-09-08 01:20:10,425 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 761 transitions. Word has length 382 [2019-09-08 01:20:10,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:10,425 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 761 transitions. [2019-09-08 01:20:10,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-08 01:20:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 761 transitions. [2019-09-08 01:20:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-09-08 01:20:10,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:10,427 INFO L399 BasicCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:10,427 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash 821145524, now seen corresponding path program 125 times [2019-09-08 01:20:10,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:10,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:10,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:10,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23375 backedges. 0 proven. 23375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:15,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:15,998 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:20:16,009 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:20:16,609 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 126 check-sat command(s) [2019-09-08 01:20:16,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:16,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1772 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-08 01:20:16,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 23375 backedges. 0 proven. 23375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:16,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:16,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 128 [2019-09-08 01:20:16,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-08 01:20:16,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-08 01:20:16,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-08 01:20:16,724 INFO L87 Difference]: Start difference. First operand 511 states and 761 transitions. Second operand 128 states. [2019-09-08 01:20:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:18,939 INFO L93 Difference]: Finished difference Result 523 states and 777 transitions. [2019-09-08 01:20:18,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-08 01:20:18,939 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 385 [2019-09-08 01:20:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:18,940 INFO L225 Difference]: With dead ends: 523 [2019-09-08 01:20:18,941 INFO L226 Difference]: Without dead ends: 518 [2019-09-08 01:20:18,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 386 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:20:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-09-08 01:20:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 515. [2019-09-08 01:20:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-09-08 01:20:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 767 transitions. [2019-09-08 01:20:18,946 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 767 transitions. Word has length 385 [2019-09-08 01:20:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:18,946 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 767 transitions. [2019-09-08 01:20:18,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-08 01:20:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 767 transitions. [2019-09-08 01:20:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 01:20:18,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:18,948 INFO L399 BasicCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:18,949 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash 133158033, now seen corresponding path program 126 times [2019-09-08 01:20:18,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:18,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:18,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 23751 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:24,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:24,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 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:20:24,697 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:20:25,315 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2019-09-08 01:20:25,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:25,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-08 01:20:25,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 23751 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:25,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:25,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2019-09-08 01:20:25,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-08 01:20:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-08 01:20:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 01:20:25,472 INFO L87 Difference]: Start difference. First operand 515 states and 767 transitions. Second operand 129 states. [2019-09-08 01:20:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:27,896 INFO L93 Difference]: Finished difference Result 527 states and 783 transitions. [2019-09-08 01:20:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-08 01:20:27,897 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 388 [2019-09-08 01:20:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:27,898 INFO L225 Difference]: With dead ends: 527 [2019-09-08 01:20:27,898 INFO L226 Difference]: Without dead ends: 522 [2019-09-08 01:20:27,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 01:20:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-08 01:20:27,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 519. [2019-09-08 01:20:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-08 01:20:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 773 transitions. [2019-09-08 01:20:27,905 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 773 transitions. Word has length 388 [2019-09-08 01:20:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:27,906 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 773 transitions. [2019-09-08 01:20:27,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-08 01:20:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 773 transitions. [2019-09-08 01:20:27,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 01:20:27,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:27,908 INFO L399 BasicCegarLoop]: trace histogram [127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:27,908 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:27,908 INFO L82 PathProgramCache]: Analyzing trace with hash -118249836, now seen corresponding path program 127 times [2019-09-08 01:20:27,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:27,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:27,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 24130 backedges. 0 proven. 24130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:33,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:33,556 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:20:33,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:20:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:33,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 1800 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-08 01:20:33,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 24130 backedges. 0 proven. 24130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:33,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:33,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130] total 130 [2019-09-08 01:20:33,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-08 01:20:33,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-08 01:20:33,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-08 01:20:33,972 INFO L87 Difference]: Start difference. First operand 519 states and 773 transitions. Second operand 130 states. [2019-09-08 01:20:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:38,120 INFO L93 Difference]: Finished difference Result 531 states and 789 transitions. [2019-09-08 01:20:38,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-08 01:20:38,121 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 391 [2019-09-08 01:20:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:38,122 INFO L225 Difference]: With dead ends: 531 [2019-09-08 01:20:38,122 INFO L226 Difference]: Without dead ends: 526 [2019-09-08 01:20:38,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-08 01:20:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-08 01:20:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2019-09-08 01:20:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-09-08 01:20:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 779 transitions. [2019-09-08 01:20:38,128 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 779 transitions. Word has length 391 [2019-09-08 01:20:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:38,129 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 779 transitions. [2019-09-08 01:20:38,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-08 01:20:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 779 transitions. [2019-09-08 01:20:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-09-08 01:20:38,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:38,131 INFO L399 BasicCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:38,131 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:38,132 INFO L82 PathProgramCache]: Analyzing trace with hash 612889009, now seen corresponding path program 128 times [2019-09-08 01:20:38,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:38,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:38,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:38,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:20:38,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 24512 backedges. 0 proven. 24512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:43,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:43,928 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:20:43,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:20:44,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:20:44,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:44,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1814 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-08 01:20:44,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 24512 backedges. 0 proven. 24512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:44,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:44,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2019-09-08 01:20:44,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-08 01:20:44,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-08 01:20:44,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-08 01:20:44,370 INFO L87 Difference]: Start difference. First operand 523 states and 779 transitions. Second operand 131 states. [2019-09-08 01:20:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:47,997 INFO L93 Difference]: Finished difference Result 535 states and 795 transitions. [2019-09-08 01:20:47,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-08 01:20:47,997 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 394 [2019-09-08 01:20:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:47,998 INFO L225 Difference]: With dead ends: 535 [2019-09-08 01:20:47,998 INFO L226 Difference]: Without dead ends: 530 [2019-09-08 01:20:47,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-08 01:20:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-09-08 01:20:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 527. [2019-09-08 01:20:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-08 01:20:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 785 transitions. [2019-09-08 01:20:48,003 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 785 transitions. Word has length 394 [2019-09-08 01:20:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:48,003 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 785 transitions. [2019-09-08 01:20:48,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-08 01:20:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 785 transitions. [2019-09-08 01:20:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-08 01:20:48,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:48,005 INFO L399 BasicCegarLoop]: trace histogram [129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:48,005 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:48,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2103904908, now seen corresponding path program 129 times [2019-09-08 01:20:48,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:48,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:48,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:48,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:48,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 24897 backedges. 0 proven. 24897 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:53,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:53,970 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:20:53,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:20:54,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 130 check-sat command(s) [2019-09-08 01:20:54,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:54,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 1828 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-08 01:20:54,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 24897 backedges. 0 proven. 24897 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:54,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:54,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 132 [2019-09-08 01:20:54,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-08 01:20:54,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-08 01:20:54,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 01:20:54,751 INFO L87 Difference]: Start difference. First operand 527 states and 785 transitions. Second operand 132 states. [2019-09-08 01:20:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:58,181 INFO L93 Difference]: Finished difference Result 539 states and 801 transitions. [2019-09-08 01:20:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-08 01:20:58,182 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 397 [2019-09-08 01:20:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:58,183 INFO L225 Difference]: With dead ends: 539 [2019-09-08 01:20:58,183 INFO L226 Difference]: Without dead ends: 534 [2019-09-08 01:20:58,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 01:20:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-08 01:20:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 531. [2019-09-08 01:20:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-08 01:20:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 791 transitions. [2019-09-08 01:20:58,190 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 791 transitions. Word has length 397 [2019-09-08 01:20:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:58,191 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 791 transitions. [2019-09-08 01:20:58,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-08 01:20:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 791 transitions. [2019-09-08 01:20:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-08 01:20:58,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:58,193 INFO L399 BasicCegarLoop]: trace histogram [130, 130, 130, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:58,193 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash 547206865, now seen corresponding path program 130 times [2019-09-08 01:20:58,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:58,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:58,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:58,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:58,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 25285 backedges. 0 proven. 25285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:04,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:04,270 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:21:04,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:21:04,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:21:04,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:04,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1842 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-08 01:21:04,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 25285 backedges. 0 proven. 25285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:04,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:04,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2019-09-08 01:21:04,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-08 01:21:04,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-08 01:21:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-09-08 01:21:04,701 INFO L87 Difference]: Start difference. First operand 531 states and 791 transitions. Second operand 133 states. [2019-09-08 01:21:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:09,307 INFO L93 Difference]: Finished difference Result 543 states and 807 transitions. [2019-09-08 01:21:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-08 01:21:09,307 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 400 [2019-09-08 01:21:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:09,308 INFO L225 Difference]: With dead ends: 543 [2019-09-08 01:21:09,308 INFO L226 Difference]: Without dead ends: 538 [2019-09-08 01:21:09,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 401 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:21:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-08 01:21:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 535. [2019-09-08 01:21:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-08 01:21:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 797 transitions. [2019-09-08 01:21:09,313 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 797 transitions. Word has length 400 [2019-09-08 01:21:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:09,314 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 797 transitions. [2019-09-08 01:21:09,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-08 01:21:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 797 transitions. [2019-09-08 01:21:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 01:21:09,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:09,315 INFO L399 BasicCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:09,315 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:09,316 INFO L82 PathProgramCache]: Analyzing trace with hash -335569836, now seen corresponding path program 131 times [2019-09-08 01:21:09,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:09,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:09,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:09,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:09,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 25676 backedges. 0 proven. 25676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:15,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:15,411 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:21:15,421 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:21:16,068 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 132 check-sat command(s) [2019-09-08 01:21:16,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:16,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1856 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-08 01:21:16,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25676 backedges. 0 proven. 25676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:16,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:16,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 134 [2019-09-08 01:21:16,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-09-08 01:21:16,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-09-08 01:21:16,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-08 01:21:16,195 INFO L87 Difference]: Start difference. First operand 535 states and 797 transitions. Second operand 134 states. [2019-09-08 01:21:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:20,939 INFO L93 Difference]: Finished difference Result 547 states and 813 transitions. [2019-09-08 01:21:20,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-08 01:21:20,939 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 403 [2019-09-08 01:21:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:20,940 INFO L225 Difference]: With dead ends: 547 [2019-09-08 01:21:20,941 INFO L226 Difference]: Without dead ends: 542 [2019-09-08 01:21:20,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-08 01:21:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-08 01:21:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 539. [2019-09-08 01:21:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-09-08 01:21:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 803 transitions. [2019-09-08 01:21:20,946 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 803 transitions. Word has length 403 [2019-09-08 01:21:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:20,947 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 803 transitions. [2019-09-08 01:21:20,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-09-08 01:21:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 803 transitions. [2019-09-08 01:21:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-09-08 01:21:20,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:20,948 INFO L399 BasicCegarLoop]: trace histogram [132, 132, 132, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:20,949 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:20,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:20,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1051515919, now seen corresponding path program 132 times [2019-09-08 01:21:20,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:20,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:20,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:20,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:20,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 26070 backedges. 0 proven. 26070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:27,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:27,181 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:21:27,191 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:21:27,919 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 133 check-sat command(s) [2019-09-08 01:21:27,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:27,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 1870 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-08 01:21:27,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 26070 backedges. 0 proven. 26070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:28,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:28,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2019-09-08 01:21:28,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-08 01:21:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-08 01:21:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-08 01:21:28,048 INFO L87 Difference]: Start difference. First operand 539 states and 803 transitions. Second operand 135 states. [2019-09-08 01:21:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:33,191 INFO L93 Difference]: Finished difference Result 551 states and 819 transitions. [2019-09-08 01:21:33,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-08 01:21:33,191 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 406 [2019-09-08 01:21:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:33,192 INFO L225 Difference]: With dead ends: 551 [2019-09-08 01:21:33,192 INFO L226 Difference]: Without dead ends: 546 [2019-09-08 01:21:33,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-08 01:21:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-08 01:21:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 543. [2019-09-08 01:21:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-08 01:21:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 809 transitions. [2019-09-08 01:21:33,197 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 809 transitions. Word has length 406 [2019-09-08 01:21:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:33,197 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 809 transitions. [2019-09-08 01:21:33,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-08 01:21:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 809 transitions. [2019-09-08 01:21:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 01:21:33,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:33,199 INFO L399 BasicCegarLoop]: trace histogram [133, 133, 133, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:33,199 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:33,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:33,199 INFO L82 PathProgramCache]: Analyzing trace with hash -993682636, now seen corresponding path program 133 times [2019-09-08 01:21:33,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:33,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:33,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:33,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:33,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 26467 backedges. 0 proven. 26467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:39,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:39,472 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:21:39,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:21:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:39,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 135 conjunts are in the unsatisfiable core [2019-09-08 01:21:39,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 26467 backedges. 0 proven. 26467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:39,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:39,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136] total 136 [2019-09-08 01:21:39,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-08 01:21:39,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-08 01:21:39,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-08 01:21:39,891 INFO L87 Difference]: Start difference. First operand 543 states and 809 transitions. Second operand 136 states. [2019-09-08 01:21:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:42,572 INFO L93 Difference]: Finished difference Result 555 states and 825 transitions. [2019-09-08 01:21:42,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-08 01:21:42,573 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 409 [2019-09-08 01:21:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:42,574 INFO L225 Difference]: With dead ends: 555 [2019-09-08 01:21:42,574 INFO L226 Difference]: Without dead ends: 550 [2019-09-08 01:21:42,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-08 01:21:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-08 01:21:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 547. [2019-09-08 01:21:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 01:21:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 815 transitions. [2019-09-08 01:21:42,579 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 815 transitions. Word has length 409 [2019-09-08 01:21:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:42,579 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 815 transitions. [2019-09-08 01:21:42,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-08 01:21:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 815 transitions. [2019-09-08 01:21:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-08 01:21:42,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:42,581 INFO L399 BasicCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:42,581 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:42,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:42,582 INFO L82 PathProgramCache]: Analyzing trace with hash -364234479, now seen corresponding path program 134 times [2019-09-08 01:21:42,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:42,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:42,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:42,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:21:42,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 26867 backedges. 0 proven. 26867 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:48,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:48,890 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:21:48,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:21:49,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:21:49,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:49,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-08 01:21:49,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 26867 backedges. 0 proven. 26867 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:49,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:49,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2019-09-08 01:21:49,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-08 01:21:49,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-08 01:21:49,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-08 01:21:49,330 INFO L87 Difference]: Start difference. First operand 547 states and 815 transitions. Second operand 137 states. [2019-09-08 01:21:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:54,267 INFO L93 Difference]: Finished difference Result 559 states and 831 transitions. [2019-09-08 01:21:54,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-08 01:21:54,267 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 412 [2019-09-08 01:21:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:54,268 INFO L225 Difference]: With dead ends: 559 [2019-09-08 01:21:54,268 INFO L226 Difference]: Without dead ends: 554 [2019-09-08 01:21:54,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-08 01:21:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-08 01:21:54,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2019-09-08 01:21:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 01:21:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 821 transitions. [2019-09-08 01:21:54,275 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 821 transitions. Word has length 412 [2019-09-08 01:21:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:54,275 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 821 transitions. [2019-09-08 01:21:54,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-08 01:21:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 821 transitions. [2019-09-08 01:21:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-09-08 01:21:54,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:54,278 INFO L399 BasicCegarLoop]: trace histogram [135, 135, 135, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:54,278 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash -301403628, now seen corresponding path program 135 times [2019-09-08 01:21:54,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:54,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:54,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 27270 backedges. 0 proven. 27270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:00,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:00,841 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:22:00,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:22:01,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 136 check-sat command(s) [2019-09-08 01:22:01,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:01,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-08 01:22:01,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 27270 backedges. 0 proven. 27270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:01,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:01,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138] total 138 [2019-09-08 01:22:01,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-08 01:22:01,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-08 01:22:01,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 01:22:01,675 INFO L87 Difference]: Start difference. First operand 551 states and 821 transitions. Second operand 138 states. [2019-09-08 01:22:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:05,817 INFO L93 Difference]: Finished difference Result 563 states and 837 transitions. [2019-09-08 01:22:05,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-08 01:22:05,818 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 415 [2019-09-08 01:22:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:05,819 INFO L225 Difference]: With dead ends: 563 [2019-09-08 01:22:05,819 INFO L226 Difference]: Without dead ends: 558 [2019-09-08 01:22:05,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 416 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:22:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-08 01:22:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 555. [2019-09-08 01:22:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-08 01:22:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 827 transitions. [2019-09-08 01:22:05,824 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 827 transitions. Word has length 415 [2019-09-08 01:22:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:05,824 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 827 transitions. [2019-09-08 01:22:05,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-08 01:22:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 827 transitions. [2019-09-08 01:22:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-08 01:22:05,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:05,826 INFO L399 BasicCegarLoop]: trace histogram [136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:05,826 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:05,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1113262543, now seen corresponding path program 136 times [2019-09-08 01:22:05,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:05,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:05,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:05,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:05,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 27676 backedges. 0 proven. 27676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:12,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:12,415 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:22:12,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:22:12,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:22:12,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:12,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1926 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-08 01:22:12,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 27676 backedges. 0 proven. 27676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:12,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:12,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2019-09-08 01:22:12,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-08 01:22:12,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-08 01:22:12,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 01:22:12,874 INFO L87 Difference]: Start difference. First operand 555 states and 827 transitions. Second operand 139 states. [2019-09-08 01:22:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:18,525 INFO L93 Difference]: Finished difference Result 567 states and 843 transitions. [2019-09-08 01:22:18,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-08 01:22:18,526 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 418 [2019-09-08 01:22:18,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:18,527 INFO L225 Difference]: With dead ends: 567 [2019-09-08 01:22:18,527 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 01:22:18,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 01:22:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 01:22:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 559. [2019-09-08 01:22:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-08 01:22:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 833 transitions. [2019-09-08 01:22:18,535 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 833 transitions. Word has length 418 [2019-09-08 01:22:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:18,535 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 833 transitions. [2019-09-08 01:22:18,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-08 01:22:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 833 transitions. [2019-09-08 01:22:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-08 01:22:18,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:18,538 INFO L399 BasicCegarLoop]: trace histogram [137, 137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:18,538 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:18,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:18,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2053611764, now seen corresponding path program 137 times [2019-09-08 01:22:18,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:18,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:18,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:18,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:18,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 28085 backedges. 0 proven. 28085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:25,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:25,115 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:22:25,124 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:22:25,810 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 138 check-sat command(s) [2019-09-08 01:22:25,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:25,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1940 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-08 01:22:25,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 28085 backedges. 0 proven. 28085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:25,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:25,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 140 [2019-09-08 01:22:25,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-09-08 01:22:25,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-09-08 01:22:25,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-08 01:22:25,976 INFO L87 Difference]: Start difference. First operand 559 states and 833 transitions. Second operand 140 states. [2019-09-08 01:22:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:31,447 INFO L93 Difference]: Finished difference Result 571 states and 849 transitions. [2019-09-08 01:22:31,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-08 01:22:31,447 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 421 [2019-09-08 01:22:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:31,448 INFO L225 Difference]: With dead ends: 571 [2019-09-08 01:22:31,448 INFO L226 Difference]: Without dead ends: 566 [2019-09-08 01:22:31,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-08 01:22:31,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-09-08 01:22:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 563. [2019-09-08 01:22:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-08 01:22:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 839 transitions. [2019-09-08 01:22:31,453 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 839 transitions. Word has length 421 [2019-09-08 01:22:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:31,454 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 839 transitions. [2019-09-08 01:22:31,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-09-08 01:22:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 839 transitions. [2019-09-08 01:22:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-09-08 01:22:31,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:31,455 INFO L399 BasicCegarLoop]: trace histogram [138, 138, 138, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:31,455 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:31,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:31,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1140499631, now seen corresponding path program 138 times [2019-09-08 01:22:31,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:31,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:31,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:31,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:31,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28497 backedges. 0 proven. 28497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:38,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:38,193 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:22:38,204 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:22:38,930 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2019-09-08 01:22:38,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:38,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 1954 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-08 01:22:38,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28497 backedges. 0 proven. 28497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:39,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:39,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2019-09-08 01:22:39,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-08 01:22:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-08 01:22:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-08 01:22:39,068 INFO L87 Difference]: Start difference. First operand 563 states and 839 transitions. Second operand 141 states. [2019-09-08 01:22:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:44,785 INFO L93 Difference]: Finished difference Result 575 states and 855 transitions. [2019-09-08 01:22:44,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-08 01:22:44,785 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 424 [2019-09-08 01:22:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:44,786 INFO L225 Difference]: With dead ends: 575 [2019-09-08 01:22:44,786 INFO L226 Difference]: Without dead ends: 570 [2019-09-08 01:22:44,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-08 01:22:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-08 01:22:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 567. [2019-09-08 01:22:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-08 01:22:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 845 transitions. [2019-09-08 01:22:44,791 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 845 transitions. Word has length 424 [2019-09-08 01:22:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:44,792 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 845 transitions. [2019-09-08 01:22:44,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-08 01:22:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 845 transitions. [2019-09-08 01:22:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-09-08 01:22:44,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:44,793 INFO L399 BasicCegarLoop]: trace histogram [139, 139, 139, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:44,793 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1912625196, now seen corresponding path program 139 times [2019-09-08 01:22:44,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:44,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:44,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 28912 backedges. 0 proven. 28912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:51,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:51,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:22:51,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:22:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:51,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1968 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-08 01:22:51,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 28912 backedges. 0 proven. 28912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:52,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:52,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 142] total 142 [2019-09-08 01:22:52,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-08 01:22:52,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-08 01:22:52,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-08 01:22:52,052 INFO L87 Difference]: Start difference. First operand 567 states and 845 transitions. Second operand 142 states. [2019-09-08 01:22:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:57,134 INFO L93 Difference]: Finished difference Result 579 states and 861 transitions. [2019-09-08 01:22:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-08 01:22:57,134 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 427 [2019-09-08 01:22:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:57,135 INFO L225 Difference]: With dead ends: 579 [2019-09-08 01:22:57,135 INFO L226 Difference]: Without dead ends: 574 [2019-09-08 01:22:57,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 428 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:22:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-08 01:22:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 571. [2019-09-08 01:22:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-08 01:22:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 851 transitions. [2019-09-08 01:22:57,143 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 851 transitions. Word has length 427 [2019-09-08 01:22:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:57,143 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 851 transitions. [2019-09-08 01:22:57,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-08 01:22:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 851 transitions. [2019-09-08 01:22:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-09-08 01:22:57,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:57,146 INFO L399 BasicCegarLoop]: trace histogram [140, 140, 140, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:57,146 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash -460494735, now seen corresponding path program 140 times [2019-09-08 01:22:57,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:57,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:57,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:57,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:22:57,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 29330 backedges. 0 proven. 29330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:04,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:04,167 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:23:04,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:23:04,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:23:04,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:04,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 1982 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-08 01:23:04,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 29330 backedges. 0 proven. 29330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:04,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:04,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2019-09-08 01:23:04,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-08 01:23:04,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-08 01:23:04,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-08 01:23:04,638 INFO L87 Difference]: Start difference. First operand 571 states and 851 transitions. Second operand 143 states. [2019-09-08 01:23:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:10,279 INFO L93 Difference]: Finished difference Result 583 states and 867 transitions. [2019-09-08 01:23:10,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-08 01:23:10,279 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 430 [2019-09-08 01:23:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:10,280 INFO L225 Difference]: With dead ends: 583 [2019-09-08 01:23:10,280 INFO L226 Difference]: Without dead ends: 578 [2019-09-08 01:23:10,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-08 01:23:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-08 01:23:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 575. [2019-09-08 01:23:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-08 01:23:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 857 transitions. [2019-09-08 01:23:10,285 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 857 transitions. Word has length 430 [2019-09-08 01:23:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:10,286 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 857 transitions. [2019-09-08 01:23:10,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-08 01:23:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 857 transitions. [2019-09-08 01:23:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-08 01:23:10,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:10,287 INFO L399 BasicCegarLoop]: trace histogram [141, 141, 141, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:10,288 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:10,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1047463604, now seen corresponding path program 141 times [2019-09-08 01:23:10,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:10,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:10,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:10,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:10,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 29751 backedges. 0 proven. 29751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:17,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:17,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 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:23:17,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:23:17,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 142 check-sat command(s) [2019-09-08 01:23:17,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:17,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1996 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-08 01:23:17,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 29751 backedges. 0 proven. 29751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:18,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:18,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 144] total 144 [2019-09-08 01:23:18,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-08 01:23:18,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-08 01:23:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-08 01:23:18,112 INFO L87 Difference]: Start difference. First operand 575 states and 857 transitions. Second operand 144 states. [2019-09-08 01:23:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:21,228 INFO L93 Difference]: Finished difference Result 587 states and 873 transitions. [2019-09-08 01:23:21,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-08 01:23:21,228 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 433 [2019-09-08 01:23:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:21,229 INFO L225 Difference]: With dead ends: 587 [2019-09-08 01:23:21,229 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 01:23:21,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-08 01:23:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 01:23:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 579. [2019-09-08 01:23:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 01:23:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 863 transitions. [2019-09-08 01:23:21,235 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 863 transitions. Word has length 433 [2019-09-08 01:23:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:21,235 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 863 transitions. [2019-09-08 01:23:21,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-08 01:23:21,235 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 863 transitions. [2019-09-08 01:23:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-08 01:23:21,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:21,237 INFO L399 BasicCegarLoop]: trace histogram [142, 142, 142, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:21,237 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:21,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:21,237 INFO L82 PathProgramCache]: Analyzing trace with hash -723575407, now seen corresponding path program 142 times [2019-09-08 01:23:21,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:21,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:21,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:21,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:21,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 30175 backedges. 0 proven. 30175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:28,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:28,314 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:23:28,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:23:28,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:23:28,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:28,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 2010 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-08 01:23:28,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 30175 backedges. 0 proven. 30175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:28,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:28,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2019-09-08 01:23:28,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-08 01:23:28,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-08 01:23:28,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-08 01:23:28,782 INFO L87 Difference]: Start difference. First operand 579 states and 863 transitions. Second operand 145 states. [2019-09-08 01:23:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:35,415 INFO L93 Difference]: Finished difference Result 591 states and 879 transitions. [2019-09-08 01:23:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 01:23:35,415 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 436 [2019-09-08 01:23:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:35,416 INFO L225 Difference]: With dead ends: 591 [2019-09-08 01:23:35,416 INFO L226 Difference]: Without dead ends: 586 [2019-09-08 01:23:35,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 437 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:23:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-08 01:23:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2019-09-08 01:23:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 01:23:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 869 transitions. [2019-09-08 01:23:35,421 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 869 transitions. Word has length 436 [2019-09-08 01:23:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:35,421 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 869 transitions. [2019-09-08 01:23:35,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-08 01:23:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 869 transitions. [2019-09-08 01:23:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-08 01:23:35,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:35,423 INFO L399 BasicCegarLoop]: trace histogram [143, 143, 143, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:35,423 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1926479252, now seen corresponding path program 143 times [2019-09-08 01:23:35,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:35,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:35,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:35,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:35,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30602 backedges. 0 proven. 30602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:42,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:42,524 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:23:42,534 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:23:43,260 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 144 check-sat command(s) [2019-09-08 01:23:43,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:43,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 2024 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-08 01:23:43,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30602 backedges. 0 proven. 30602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:43,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:43,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 146 [2019-09-08 01:23:43,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-09-08 01:23:43,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-09-08 01:23:43,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-08 01:23:43,440 INFO L87 Difference]: Start difference. First operand 583 states and 869 transitions. Second operand 146 states. [2019-09-08 01:23:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:48,664 INFO L93 Difference]: Finished difference Result 595 states and 885 transitions. [2019-09-08 01:23:48,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-08 01:23:48,665 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 439 [2019-09-08 01:23:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:48,666 INFO L225 Difference]: With dead ends: 595 [2019-09-08 01:23:48,666 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 01:23:48,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-08 01:23:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 01:23:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 587. [2019-09-08 01:23:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 01:23:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 875 transitions. [2019-09-08 01:23:48,671 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 875 transitions. Word has length 439 [2019-09-08 01:23:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:48,671 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 875 transitions. [2019-09-08 01:23:48,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-09-08 01:23:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 875 transitions. [2019-09-08 01:23:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-08 01:23:48,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:48,673 INFO L399 BasicCegarLoop]: trace histogram [144, 144, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:48,673 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash -384009551, now seen corresponding path program 144 times [2019-09-08 01:23:48,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:48,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:48,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:48,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:48,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 31032 backedges. 0 proven. 31032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:56,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:56,047 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:23:56,057 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:23:56,796 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2019-09-08 01:23:56,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:56,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 2038 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-08 01:23:56,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 31032 backedges. 0 proven. 31032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:56,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:56,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2019-09-08 01:23:56,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-08 01:23:56,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-08 01:23:56,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-08 01:23:56,943 INFO L87 Difference]: Start difference. First operand 587 states and 875 transitions. Second operand 147 states. [2019-09-08 01:24:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:03,904 INFO L93 Difference]: Finished difference Result 599 states and 891 transitions. [2019-09-08 01:24:03,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-08 01:24:03,905 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 442 [2019-09-08 01:24:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:03,906 INFO L225 Difference]: With dead ends: 599 [2019-09-08 01:24:03,906 INFO L226 Difference]: Without dead ends: 594 [2019-09-08 01:24:03,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-08 01:24:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-08 01:24:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 591. [2019-09-08 01:24:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 01:24:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 881 transitions. [2019-09-08 01:24:03,911 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 881 transitions. Word has length 442 [2019-09-08 01:24:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:03,912 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 881 transitions. [2019-09-08 01:24:03,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-08 01:24:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 881 transitions. [2019-09-08 01:24:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-08 01:24:03,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:03,913 INFO L399 BasicCegarLoop]: trace histogram [145, 145, 145, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:03,913 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:03,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:03,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1010054028, now seen corresponding path program 145 times [2019-09-08 01:24:03,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:03,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:03,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:03,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:24:03,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 31465 backedges. 0 proven. 31465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:11,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:11,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 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:24:11,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:24:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:11,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 2052 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-08 01:24:11,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 31465 backedges. 0 proven. 31465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:11,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:11,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 148] total 148 [2019-09-08 01:24:11,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-08 01:24:11,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-08 01:24:11,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-08 01:24:11,777 INFO L87 Difference]: Start difference. First operand 591 states and 881 transitions. Second operand 148 states. [2019-09-08 01:24:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:15,930 INFO L93 Difference]: Finished difference Result 603 states and 897 transitions. [2019-09-08 01:24:15,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-08 01:24:15,931 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 445 [2019-09-08 01:24:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:15,932 INFO L225 Difference]: With dead ends: 603 [2019-09-08 01:24:15,932 INFO L226 Difference]: Without dead ends: 598 [2019-09-08 01:24:15,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-08 01:24:15,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-08 01:24:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2019-09-08 01:24:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 01:24:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 887 transitions. [2019-09-08 01:24:15,938 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 887 transitions. Word has length 445 [2019-09-08 01:24:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:15,939 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 887 transitions. [2019-09-08 01:24:15,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-08 01:24:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 887 transitions. [2019-09-08 01:24:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-09-08 01:24:15,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:15,941 INFO L399 BasicCegarLoop]: trace histogram [146, 146, 146, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:15,941 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:15,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1541898193, now seen corresponding path program 146 times [2019-09-08 01:24:15,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:15,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:15,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:24:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 31901 backedges. 0 proven. 31901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:23,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:23,464 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:24:23,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:24:23,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:24:23,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:24:23,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-08 01:24:23,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 31901 backedges. 0 proven. 31901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:23,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:23,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2019-09-08 01:24:23,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-08 01:24:23,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-08 01:24:23,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-08 01:24:23,952 INFO L87 Difference]: Start difference. First operand 595 states and 887 transitions. Second operand 149 states. [2019-09-08 01:24:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:30,142 INFO L93 Difference]: Finished difference Result 607 states and 903 transitions. [2019-09-08 01:24:30,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 01:24:30,142 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 448 [2019-09-08 01:24:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:30,143 INFO L225 Difference]: With dead ends: 607 [2019-09-08 01:24:30,143 INFO L226 Difference]: Without dead ends: 602 [2019-09-08 01:24:30,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-08 01:24:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-08 01:24:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 599. [2019-09-08 01:24:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 01:24:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 893 transitions. [2019-09-08 01:24:30,149 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 893 transitions. Word has length 448 [2019-09-08 01:24:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:30,149 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 893 transitions. [2019-09-08 01:24:30,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-08 01:24:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 893 transitions. [2019-09-08 01:24:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-09-08 01:24:30,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:30,151 INFO L399 BasicCegarLoop]: trace histogram [147, 147, 147, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:30,151 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:30,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:30,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1534407508, now seen corresponding path program 147 times [2019-09-08 01:24:30,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:30,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:30,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:30,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:24:30,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32340 backedges. 0 proven. 32340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:37,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:37,594 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:24:37,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:24:38,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 148 check-sat command(s) [2019-09-08 01:24:38,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:24:38,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 2080 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-08 01:24:38,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 32340 backedges. 0 proven. 32340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:38,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:38,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 150] total 150 [2019-09-08 01:24:38,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-08 01:24:38,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-08 01:24:38,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-08 01:24:38,543 INFO L87 Difference]: Start difference. First operand 599 states and 893 transitions. Second operand 150 states. [2019-09-08 01:24:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:44,745 INFO L93 Difference]: Finished difference Result 611 states and 909 transitions. [2019-09-08 01:24:44,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-08 01:24:44,745 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 451 [2019-09-08 01:24:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:44,746 INFO L225 Difference]: With dead ends: 611 [2019-09-08 01:24:44,746 INFO L226 Difference]: Without dead ends: 606 [2019-09-08 01:24:44,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-08 01:24:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-09-08 01:24:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 603. [2019-09-08 01:24:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 01:24:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 899 transitions. [2019-09-08 01:24:44,751 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 899 transitions. Word has length 451 [2019-09-08 01:24:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:44,751 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 899 transitions. [2019-09-08 01:24:44,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-08 01:24:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 899 transitions. [2019-09-08 01:24:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-08 01:24:44,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:44,753 INFO L399 BasicCegarLoop]: trace histogram [148, 148, 148, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:44,753 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:44,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710065, now seen corresponding path program 148 times [2019-09-08 01:24:44,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:44,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:44,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:44,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:24:44,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 32782 backedges. 0 proven. 32782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:52,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:52,511 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:24:52,521 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:24:52,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:24:52,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:24:52,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 2094 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-08 01:24:52,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32782 backedges. 0 proven. 32782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:53,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:53,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 151 [2019-09-08 01:24:53,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-08 01:24:53,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-08 01:24:53,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-09-08 01:24:53,005 INFO L87 Difference]: Start difference. First operand 603 states and 899 transitions. Second operand 151 states. [2019-09-08 01:24:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:57,004 INFO L93 Difference]: Finished difference Result 615 states and 915 transitions. [2019-09-08 01:24:57,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-08 01:24:57,005 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 454 [2019-09-08 01:24:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:57,006 INFO L225 Difference]: With dead ends: 615 [2019-09-08 01:24:57,006 INFO L226 Difference]: Without dead ends: 610 [2019-09-08 01:24:57,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-09-08 01:24:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-08 01:24:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 607. [2019-09-08 01:24:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-08 01:24:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 905 transitions. [2019-09-08 01:24:57,011 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 905 transitions. Word has length 454 [2019-09-08 01:24:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:57,011 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 905 transitions. [2019-09-08 01:24:57,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-08 01:24:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 905 transitions. [2019-09-08 01:24:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2019-09-08 01:24:57,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:57,013 INFO L399 BasicCegarLoop]: trace histogram [149, 149, 149, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:57,013 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:57,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:57,013 INFO L82 PathProgramCache]: Analyzing trace with hash -714214860, now seen corresponding path program 149 times [2019-09-08 01:24:57,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:57,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:57,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:57,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:24:57,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 33227 backedges. 0 proven. 33227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:04,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:04,853 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:25:04,862 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:25:05,648 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 150 check-sat command(s) [2019-09-08 01:25:05,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:25:05,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 2108 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-08 01:25:05,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 33227 backedges. 0 proven. 33227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:05,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:05,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 152] total 152 [2019-09-08 01:25:05,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-09-08 01:25:05,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-09-08 01:25:05,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-08 01:25:05,804 INFO L87 Difference]: Start difference. First operand 607 states and 905 transitions. Second operand 152 states. [2019-09-08 01:25:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:25:09,887 INFO L93 Difference]: Finished difference Result 619 states and 921 transitions. [2019-09-08 01:25:09,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-08 01:25:09,887 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 457 [2019-09-08 01:25:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:25:09,888 INFO L225 Difference]: With dead ends: 619 [2019-09-08 01:25:09,888 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 01:25:09,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-08 01:25:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 01:25:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2019-09-08 01:25:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 01:25:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 911 transitions. [2019-09-08 01:25:09,893 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 911 transitions. Word has length 457 [2019-09-08 01:25:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:25:09,894 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 911 transitions. [2019-09-08 01:25:09,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-09-08 01:25:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 911 transitions. [2019-09-08 01:25:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-09-08 01:25:09,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:25:09,896 INFO L399 BasicCegarLoop]: trace histogram [150, 150, 150, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:25:09,896 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:25:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:25:09,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1613660689, now seen corresponding path program 150 times [2019-09-08 01:25:09,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:25:09,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:25:09,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:09,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:25:09,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 33675 backedges. 0 proven. 33675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:17,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:17,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:17,826 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:25:18,626 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 151 check-sat command(s) [2019-09-08 01:25:18,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:25:18,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 2122 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-08 01:25:18,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 33675 backedges. 0 proven. 33675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:18,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:18,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 153 [2019-09-08 01:25:18,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-08 01:25:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-08 01:25:18,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-09-08 01:25:18,784 INFO L87 Difference]: Start difference. First operand 611 states and 911 transitions. Second operand 153 states. [2019-09-08 01:25:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:25:22,830 INFO L93 Difference]: Finished difference Result 623 states and 927 transitions. [2019-09-08 01:25:22,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-08 01:25:22,831 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 460 [2019-09-08 01:25:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:25:22,832 INFO L225 Difference]: With dead ends: 623 [2019-09-08 01:25:22,832 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 01:25:22,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-09-08 01:25:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 01:25:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2019-09-08 01:25:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-08 01:25:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 917 transitions. [2019-09-08 01:25:22,840 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 917 transitions. Word has length 460 [2019-09-08 01:25:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:25:22,841 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 917 transitions. [2019-09-08 01:25:22,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-08 01:25:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 917 transitions. [2019-09-08 01:25:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-09-08 01:25:22,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:25:22,844 INFO L399 BasicCegarLoop]: trace histogram [151, 151, 151, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:25:22,844 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:25:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:25:22,844 INFO L82 PathProgramCache]: Analyzing trace with hash 517212436, now seen corresponding path program 151 times [2019-09-08 01:25:22,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:25:22,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:25:22,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:22,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:25:22,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 34126 backedges. 0 proven. 34126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:30,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:30,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:30,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:25:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:31,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 2136 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-08 01:25:31,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 34126 backedges. 0 proven. 34126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:31,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:31,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154, 154] total 154 [2019-09-08 01:25:31,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-08 01:25:31,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-08 01:25:31,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-09-08 01:25:31,303 INFO L87 Difference]: Start difference. First operand 615 states and 917 transitions. Second operand 154 states. [2019-09-08 01:25:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:25:35,617 INFO L93 Difference]: Finished difference Result 627 states and 933 transitions. [2019-09-08 01:25:35,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-08 01:25:35,617 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 463 [2019-09-08 01:25:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:25:35,618 INFO L225 Difference]: With dead ends: 627 [2019-09-08 01:25:35,618 INFO L226 Difference]: Without dead ends: 622 [2019-09-08 01:25:35,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-09-08 01:25:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-08 01:25:35,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 619. [2019-09-08 01:25:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-09-08 01:25:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 923 transitions. [2019-09-08 01:25:35,623 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 923 transitions. Word has length 463 [2019-09-08 01:25:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:25:35,624 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 923 transitions. [2019-09-08 01:25:35,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-08 01:25:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 923 transitions. [2019-09-08 01:25:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 01:25:35,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:25:35,625 INFO L399 BasicCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:25:35,626 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:25:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:25:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash -546406607, now seen corresponding path program 152 times [2019-09-08 01:25:35,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:25:35,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:25:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:35,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:25:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 34580 backedges. 0 proven. 34580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:43,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:43,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:43,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:25:44,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:25:44,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:25:44,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 2150 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-08 01:25:44,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34580 backedges. 0 proven. 34580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:44,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:44,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 155 [2019-09-08 01:25:44,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-09-08 01:25:44,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-09-08 01:25:44,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-09-08 01:25:44,258 INFO L87 Difference]: Start difference. First operand 619 states and 923 transitions. Second operand 155 states. [2019-09-08 01:25:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:25:49,392 INFO L93 Difference]: Finished difference Result 631 states and 939 transitions. [2019-09-08 01:25:49,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-08 01:25:49,393 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 466 [2019-09-08 01:25:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:25:49,394 INFO L225 Difference]: With dead ends: 631 [2019-09-08 01:25:49,394 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 01:25:49,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-09-08 01:25:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 01:25:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 623. [2019-09-08 01:25:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 01:25:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 929 transitions. [2019-09-08 01:25:49,402 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 929 transitions. Word has length 466 [2019-09-08 01:25:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:25:49,402 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 929 transitions. [2019-09-08 01:25:49,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-09-08 01:25:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 929 transitions. [2019-09-08 01:25:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-08 01:25:49,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:25:49,405 INFO L399 BasicCegarLoop]: trace histogram [153, 153, 153, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:25:49,405 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:25:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:25:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1447393268, now seen corresponding path program 153 times [2019-09-08 01:25:49,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:25:49,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:25:49,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:49,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:25:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 35037 backedges. 0 proven. 35037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:57,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:57,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 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:57,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:25:58,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 154 check-sat command(s) [2019-09-08 01:25:58,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:25:58,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 2164 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-08 01:25:58,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 35037 backedges. 0 proven. 35037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:58,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:58,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156, 156] total 156 [2019-09-08 01:25:58,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-08 01:25:58,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-08 01:25:58,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-09-08 01:25:58,672 INFO L87 Difference]: Start difference. First operand 623 states and 929 transitions. Second operand 156 states. [2019-09-08 01:26:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:26:07,348 INFO L93 Difference]: Finished difference Result 635 states and 945 transitions. [2019-09-08 01:26:07,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-08 01:26:07,348 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 469 [2019-09-08 01:26:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:26:07,349 INFO L225 Difference]: With dead ends: 635 [2019-09-08 01:26:07,349 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 01:26:07,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-09-08 01:26:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 01:26:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 627. [2019-09-08 01:26:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-08 01:26:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 935 transitions. [2019-09-08 01:26:07,354 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 935 transitions. Word has length 469 [2019-09-08 01:26:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:26:07,355 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 935 transitions. [2019-09-08 01:26:07,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-08 01:26:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 935 transitions. [2019-09-08 01:26:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-09-08 01:26:07,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:26:07,357 INFO L399 BasicCegarLoop]: trace histogram [154, 154, 154, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:26:07,357 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:26:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:26:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash -658234287, now seen corresponding path program 154 times [2019-09-08 01:26:07,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:26:07,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:26:07,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:07,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:26:07,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:26:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 35497 backedges. 0 proven. 35497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:15,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:26:15,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:26:15,640 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:26:15,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:26:15,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:26:15,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 2178 conjuncts, 156 conjunts are in the unsatisfiable core [2019-09-08 01:26:15,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:26:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 35497 backedges. 0 proven. 35497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:16,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:26:16,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 157 [2019-09-08 01:26:16,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-08 01:26:16,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-08 01:26:16,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-09-08 01:26:16,155 INFO L87 Difference]: Start difference. First operand 627 states and 935 transitions. Second operand 157 states. [2019-09-08 01:26:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:26:22,871 INFO L93 Difference]: Finished difference Result 639 states and 951 transitions. [2019-09-08 01:26:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-08 01:26:22,871 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 472 [2019-09-08 01:26:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:26:22,872 INFO L225 Difference]: With dead ends: 639 [2019-09-08 01:26:22,872 INFO L226 Difference]: Without dead ends: 634 [2019-09-08 01:26:22,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-09-08 01:26:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-08 01:26:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2019-09-08 01:26:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-09-08 01:26:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 941 transitions. [2019-09-08 01:26:22,877 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 941 transitions. Word has length 472 [2019-09-08 01:26:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:26:22,877 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 941 transitions. [2019-09-08 01:26:22,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-08 01:26:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 941 transitions. [2019-09-08 01:26:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-09-08 01:26:22,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:26:22,879 INFO L399 BasicCegarLoop]: trace histogram [155, 155, 155, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:26:22,879 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:26:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:26:22,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1411367212, now seen corresponding path program 155 times [2019-09-08 01:26:22,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:26:22,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:26:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:22,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:26:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:26:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 35960 backedges. 0 proven. 35960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:31,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:26:31,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 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:26:31,386 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:26:32,237 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2019-09-08 01:26:32,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:26:32,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 2192 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-08 01:26:32,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:26:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 35960 backedges. 0 proven. 35960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:32,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:26:32,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158, 158] total 158 [2019-09-08 01:26:32,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-09-08 01:26:32,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-09-08 01:26:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-09-08 01:26:32,404 INFO L87 Difference]: Start difference. First operand 631 states and 941 transitions. Second operand 158 states. [2019-09-08 01:26:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:26:36,817 INFO L93 Difference]: Finished difference Result 643 states and 957 transitions. [2019-09-08 01:26:36,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-08 01:26:36,818 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 475 [2019-09-08 01:26:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:26:36,819 INFO L225 Difference]: With dead ends: 643 [2019-09-08 01:26:36,819 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 01:26:36,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-09-08 01:26:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 01:26:36,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2019-09-08 01:26:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-08 01:26:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 947 transitions. [2019-09-08 01:26:36,824 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 947 transitions. Word has length 475 [2019-09-08 01:26:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:26:36,825 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 947 transitions. [2019-09-08 01:26:36,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-09-08 01:26:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 947 transitions. [2019-09-08 01:26:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-08 01:26:36,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:26:36,826 INFO L399 BasicCegarLoop]: trace histogram [156, 156, 156, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:26:36,827 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:26:36,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:26:36,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1085181583, now seen corresponding path program 156 times [2019-09-08 01:26:36,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:26:36,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:26:36,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:36,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:26:36,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat