java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/fragtest_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:49:54,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:49:54,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:49:54,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:49:54,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:49:54,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:49:54,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:49:54,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:49:54,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:49:54,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:49:54,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:49:54,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:49:54,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:49:54,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:49:54,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:49:54,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:49:54,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:49:54,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:49:54,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:49:54,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:49:54,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:49:54,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:49:54,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:49:54,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:49:54,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:49:54,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:49:54,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:49:54,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:49:54,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:49:54,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:49:54,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:49:54,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:49:54,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:49:54,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:49:54,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:49:54,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:49:54,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:49:54,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:49:54,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:49:54,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:49:54,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:49:54,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:49:54,439 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:49:54,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:49:54,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:49:54,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:49:54,442 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:49:54,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:49:54,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:49:54,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:49:54,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:49:54,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:49:54,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:49:54,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:49:54,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:49:54,444 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:49:54,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:49:54,445 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:49:54,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:49:54,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:49:54,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:49:54,446 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:49:54,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:49:54,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:54,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:49:54,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:49:54,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:49:54,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:49:54,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:49:54,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:49:54,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:49:54,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:49:54,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:49:54,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:49:54,510 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:49:54,510 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:49:54,511 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/fragtest_simple.i [2019-09-03 19:49:54,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d1c49e1/a76719e5334243e7a2822305738f8c41/FLAG210ff8782 [2019-09-03 19:49:55,048 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:49:55,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/fragtest_simple.i [2019-09-03 19:49:55,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d1c49e1/a76719e5334243e7a2822305738f8c41/FLAG210ff8782 [2019-09-03 19:49:55,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d1c49e1/a76719e5334243e7a2822305738f8c41 [2019-09-03 19:49:55,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:49:55,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:49:55,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:55,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:49:55,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:49:55,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:55" (1/1) ... [2019-09-03 19:49:55,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1f1633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55, skipping insertion in model container [2019-09-03 19:49:55,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:55" (1/1) ... [2019-09-03 19:49:55,441 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:49:55,458 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:49:55,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:55,645 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:49:55,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:55,677 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:49:55,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55 WrapperNode [2019-09-03 19:49:55,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:55,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:49:55,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:49:55,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:49:55,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55" (1/1) ... [2019-09-03 19:49:55,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55" (1/1) ... [2019-09-03 19:49:55,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55" (1/1) ... [2019-09-03 19:49:55,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55" (1/1) ... [2019-09-03 19:49:55,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55" (1/1) ... [2019-09-03 19:49:55,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55" (1/1) ... [2019-09-03 19:49:55,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55" (1/1) ... [2019-09-03 19:49:55,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:49:55,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:49:55,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:49:55,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:49:55,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:55,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:49:55,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:49:55,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:49:55,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:49:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:49:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:49:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:49:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:49:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:49:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:49:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:49:56,061 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:49:56,062 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 19:49:56,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:56 BoogieIcfgContainer [2019-09-03 19:49:56,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:49:56,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:49:56,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:49:56,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:49:56,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:49:55" (1/3) ... [2019-09-03 19:49:56,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba9c7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:56, skipping insertion in model container [2019-09-03 19:49:56,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:55" (2/3) ... [2019-09-03 19:49:56,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba9c7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:56, skipping insertion in model container [2019-09-03 19:49:56,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:56" (3/3) ... [2019-09-03 19:49:56,077 INFO L109 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i [2019-09-03 19:49:56,097 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:49:56,108 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:49:56,124 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:49:56,151 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:49:56,152 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:49:56,152 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:49:56,152 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:49:56,152 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:49:56,153 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:49:56,153 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:49:56,153 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:49:56,153 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:49:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-03 19:49:56,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:49:56,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:56,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:56,175 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1300308331, now seen corresponding path program 1 times [2019-09-03 19:49:56,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:56,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:56,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:56,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:56,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:49:56,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:49:56,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:49:56,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:49:56,292 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-03 19:49:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:56,311 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-09-03 19:49:56,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:49:56,312 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-03 19:49:56,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:56,320 INFO L225 Difference]: With dead ends: 47 [2019-09-03 19:49:56,320 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:49:56,324 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-03 19:49:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:49:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 19:49:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:49:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-03 19:49:56,358 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2019-09-03 19:49:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:56,358 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-03 19:49:56,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:49:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-03 19:49:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:56,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:56,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:56,360 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:56,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1822971279, now seen corresponding path program 1 times [2019-09-03 19:49:56,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:56,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:56,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:56,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:56,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:56,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:56,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:56,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:56,456 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2019-09-03 19:49:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:56,544 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-03 19:49:56,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:56,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:56,547 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:49:56,547 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:49:56,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:49:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-03 19:49:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 19:49:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-03 19:49:56,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2019-09-03 19:49:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:56,565 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-03 19:49:56,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-03 19:49:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:49:56,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:56,567 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:56,568 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash -800300032, now seen corresponding path program 1 times [2019-09-03 19:49:56,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:56,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:56,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:56,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:56,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:56,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:56,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:56,644 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2019-09-03 19:49:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:56,734 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-09-03 19:49:56,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:56,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-09-03 19:49:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:56,738 INFO L225 Difference]: With dead ends: 49 [2019-09-03 19:49:56,738 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:49:56,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:49:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-09-03 19:49:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:49:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-03 19:49:56,749 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2019-09-03 19:49:56,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:56,750 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-03 19:49:56,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-03 19:49:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:49:56,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:56,751 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:56,752 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:56,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1153269339, now seen corresponding path program 1 times [2019-09-03 19:49:56,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:56,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:56,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:56,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:56,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:56,843 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:49:56,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:56,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:49:56,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:57,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:57,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-03 19:49:57,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:49:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:49:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:49:57,004 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 10 states. [2019-09-03 19:49:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:57,260 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-09-03 19:49:57,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:49:57,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-03 19:49:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:57,262 INFO L225 Difference]: With dead ends: 64 [2019-09-03 19:49:57,262 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 19:49:57,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:49:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 19:49:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2019-09-03 19:49:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:49:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-09-03 19:49:57,289 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2019-09-03 19:49:57,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:57,289 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-09-03 19:49:57,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:49:57,289 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-09-03 19:49:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 19:49:57,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:57,291 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:57,291 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:57,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:57,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1962487163, now seen corresponding path program 2 times [2019-09-03 19:49:57,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:57,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:57,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:57,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:57,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:49:57,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:57,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:57,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:49:57,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:49:57,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:57,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:49:57,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:49:57,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:57,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-09-03 19:49:57,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:49:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:49:57,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:49:57,504 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 11 states. [2019-09-03 19:49:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:57,629 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-09-03 19:49:57,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:49:57,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-09-03 19:49:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:57,632 INFO L225 Difference]: With dead ends: 73 [2019-09-03 19:49:57,632 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:49:57,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:49:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:49:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-09-03 19:49:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:49:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-09-03 19:49:57,641 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 37 [2019-09-03 19:49:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:57,641 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-09-03 19:49:57,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:49:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-09-03 19:49:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:49:57,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:57,643 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:57,643 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash 824114080, now seen corresponding path program 3 times [2019-09-03 19:49:57,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:57,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:57,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:49:57,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:57,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:49:57,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:57,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:49:57,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:57,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:49:57,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:57,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:49:57,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:57,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-09-03 19:49:57,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:49:57,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:49:57,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:49:57,849 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 10 states. [2019-09-03 19:49:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:57,921 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-09-03 19:49:57,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:49:57,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-09-03 19:49:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:57,922 INFO L225 Difference]: With dead ends: 57 [2019-09-03 19:49:57,923 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 19:49:57,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:49:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 19:49:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-03 19:49:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 19:49:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-03 19:49:57,932 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 39 [2019-09-03 19:49:57,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:57,932 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-03 19:49:57,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:49:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-03 19:49:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:49:57,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:57,935 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:57,935 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:57,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:57,936 INFO L82 PathProgramCache]: Analyzing trace with hash 434754946, now seen corresponding path program 4 times [2019-09-03 19:49:57,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:57,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:57,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:57,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:57,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 19:49:58,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:58,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:49:58,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:58,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:49:58,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:58,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:49:58,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 40 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:49:58,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:58,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2019-09-03 19:49:58,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:49:58,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:49:58,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:49:58,268 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 15 states. [2019-09-03 19:49:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:58,437 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2019-09-03 19:49:58,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:49:58,438 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-09-03 19:49:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:58,439 INFO L225 Difference]: With dead ends: 101 [2019-09-03 19:49:58,439 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 19:49:58,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:49:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 19:49:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2019-09-03 19:49:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 19:49:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-03 19:49:58,449 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 55 [2019-09-03 19:49:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:58,449 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-03 19:49:58,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:49:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-03 19:49:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 19:49:58,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:58,452 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:58,452 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:58,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:58,452 INFO L82 PathProgramCache]: Analyzing trace with hash -887602073, now seen corresponding path program 5 times [2019-09-03 19:49:58,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:58,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:58,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:58,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:58,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:49:58,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:58,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:49:58,592 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:58,624 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-03 19:49:58,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:58,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:49:58,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:49:58,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:58,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-09-03 19:49:58,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:49:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:49:58,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:49:58,799 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 19 states. [2019-09-03 19:49:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:59,214 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2019-09-03 19:49:59,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:49:59,215 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-09-03 19:49:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:59,219 INFO L225 Difference]: With dead ends: 114 [2019-09-03 19:49:59,219 INFO L226 Difference]: Without dead ends: 87 [2019-09-03 19:49:59,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:49:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-03 19:49:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2019-09-03 19:49:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 19:49:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-03 19:49:59,233 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 57 [2019-09-03 19:49:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:59,236 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-03 19:49:59,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:49:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-03 19:49:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-03 19:49:59,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:59,238 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:59,238 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:59,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:59,239 INFO L82 PathProgramCache]: Analyzing trace with hash 230477693, now seen corresponding path program 6 times [2019-09-03 19:49:59,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:59,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:59,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 40 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:49:59,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:59,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:59,376 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:49:59,415 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-03 19:49:59,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:59,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:49:59,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:49:59,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:59,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2019-09-03 19:49:59,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:49:59,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:49:59,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:49:59,746 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 22 states. [2019-09-03 19:50:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:00,249 INFO L93 Difference]: Finished difference Result 132 states and 155 transitions. [2019-09-03 19:50:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:50:00,250 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-09-03 19:50:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:00,252 INFO L225 Difference]: With dead ends: 132 [2019-09-03 19:50:00,252 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 19:50:00,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=305, Invalid=1255, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:50:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 19:50:00,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2019-09-03 19:50:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 19:50:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-09-03 19:50:00,275 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 67 [2019-09-03 19:50:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:00,275 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-09-03 19:50:00,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:50:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-09-03 19:50:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 19:50:00,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:00,277 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:00,277 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:00,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1711924653, now seen corresponding path program 7 times [2019-09-03 19:50:00,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:00,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:00,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 54 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:50:00,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:00,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:00,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:00,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:50:00,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 84 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:50:00,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:00,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2019-09-03 19:50:00,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:50:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:50:00,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:50:00,678 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 25 states. [2019-09-03 19:50:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:01,185 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2019-09-03 19:50:01,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:50:01,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-09-03 19:50:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:01,187 INFO L225 Difference]: With dead ends: 150 [2019-09-03 19:50:01,187 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 19:50:01,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1673, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:50:01,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 19:50:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 86. [2019-09-03 19:50:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 19:50:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-09-03 19:50:01,198 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 77 [2019-09-03 19:50:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:01,198 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2019-09-03 19:50:01,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:50:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2019-09-03 19:50:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-03 19:50:01,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:01,200 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:01,200 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:01,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:01,201 INFO L82 PathProgramCache]: Analyzing trace with hash -252693271, now seen corresponding path program 8 times [2019-09-03 19:50:01,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:01,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:01,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:01,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:01,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 70 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:50:01,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:01,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:50:01,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:50:01,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:01,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:01,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:50:01,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 112 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:50:01,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:01,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 28 [2019-09-03 19:50:01,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:50:01,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:50:01,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:50:01,676 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 28 states. [2019-09-03 19:50:02,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:02,289 INFO L93 Difference]: Finished difference Result 168 states and 197 transitions. [2019-09-03 19:50:02,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:50:02,290 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2019-09-03 19:50:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:02,291 INFO L225 Difference]: With dead ends: 168 [2019-09-03 19:50:02,292 INFO L226 Difference]: Without dead ends: 129 [2019-09-03 19:50:02,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=501, Invalid=2151, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:50:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-03 19:50:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 96. [2019-09-03 19:50:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 19:50:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-09-03 19:50:02,315 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 87 [2019-09-03 19:50:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:02,316 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-09-03 19:50:02,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:50:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-09-03 19:50:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-03 19:50:02,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:02,321 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:02,321 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:02,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:02,321 INFO L82 PathProgramCache]: Analyzing trace with hash -482136257, now seen corresponding path program 9 times [2019-09-03 19:50:02,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:02,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:02,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:02,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:02,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 88 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:50:02,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:02,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:02,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:02,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:50:02,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:02,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:50:02,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 144 proven. 72 refuted. 0 times theorem prover too weak. 112 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-03 19:50:02,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:02,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2019-09-03 19:50:02,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:50:02,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:50:02,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:50:02,879 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 31 states. [2019-09-03 19:50:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:03,592 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2019-09-03 19:50:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:50:03,592 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2019-09-03 19:50:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:03,593 INFO L225 Difference]: With dead ends: 186 [2019-09-03 19:50:03,594 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 19:50:03,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=617, Invalid=2689, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:50:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 19:50:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 106. [2019-09-03 19:50:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-03 19:50:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2019-09-03 19:50:03,603 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 97 [2019-09-03 19:50:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:03,604 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2019-09-03 19:50:03,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:50:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2019-09-03 19:50:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-03 19:50:03,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:03,605 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:03,605 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:03,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:03,606 INFO L82 PathProgramCache]: Analyzing trace with hash -101508779, now seen corresponding path program 10 times [2019-09-03 19:50:03,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:03,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:03,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 108 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:50:03,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:03,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:03,749 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-03 19:50:03,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:03,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:03,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:50:03,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 180 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:50:04,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:04,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 34 [2019-09-03 19:50:04,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:50:04,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:50:04,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:50:04,150 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 34 states. [2019-09-03 19:50:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:04,954 INFO L93 Difference]: Finished difference Result 204 states and 239 transitions. [2019-09-03 19:50:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:50:04,955 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 107 [2019-09-03 19:50:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:04,957 INFO L225 Difference]: With dead ends: 204 [2019-09-03 19:50:04,957 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 19:50:04,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=745, Invalid=3287, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:50:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 19:50:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2019-09-03 19:50:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 19:50:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2019-09-03 19:50:04,968 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 107 [2019-09-03 19:50:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:04,968 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2019-09-03 19:50:04,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:50:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2019-09-03 19:50:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 19:50:04,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:04,969 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:04,970 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1620049109, now seen corresponding path program 11 times [2019-09-03 19:50:04,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:04,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:04,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 130 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:50:05,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:05,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:05,134 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:05,182 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-03 19:50:05,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:05,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:50:05,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 220 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:50:05,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:05,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 37 [2019-09-03 19:50:05,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:50:05,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:50:05,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1096, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:50:05,638 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 37 states. [2019-09-03 19:50:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:06,560 INFO L93 Difference]: Finished difference Result 222 states and 260 transitions. [2019-09-03 19:50:06,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:50:06,561 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 117 [2019-09-03 19:50:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:06,563 INFO L225 Difference]: With dead ends: 222 [2019-09-03 19:50:06,564 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 19:50:06,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=885, Invalid=3945, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:50:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 19:50:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2019-09-03 19:50:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 19:50:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2019-09-03 19:50:06,574 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 117 [2019-09-03 19:50:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:06,574 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2019-09-03 19:50:06,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:50:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2019-09-03 19:50:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-03 19:50:06,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:06,576 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:06,576 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:06,577 INFO L82 PathProgramCache]: Analyzing trace with hash 144047297, now seen corresponding path program 12 times [2019-09-03 19:50:06,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:06,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:06,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 154 proven. 242 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:50:06,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:06,753 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:06,765 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:06,821 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-09-03 19:50:06,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:06,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:50:06,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 264 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:50:07,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:07,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26] total 40 [2019-09-03 19:50:07,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:50:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:50:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:50:07,385 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand 40 states. [2019-09-03 19:50:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:08,437 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2019-09-03 19:50:08,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:50:08,439 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 127 [2019-09-03 19:50:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:08,441 INFO L225 Difference]: With dead ends: 240 [2019-09-03 19:50:08,441 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 19:50:08,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1037, Invalid=4663, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:50:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 19:50:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 136. [2019-09-03 19:50:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 19:50:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2019-09-03 19:50:08,461 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 127 [2019-09-03 19:50:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:08,463 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2019-09-03 19:50:08,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:50:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2019-09-03 19:50:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-03 19:50:08,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:08,465 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:08,465 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:08,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:08,465 INFO L82 PathProgramCache]: Analyzing trace with hash -575859177, now seen corresponding path program 13 times [2019-09-03 19:50:08,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:08,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:08,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 180 proven. 288 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:50:08,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:08,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:08,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:08,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:50:08,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 312 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:50:09,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:09,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 28] total 43 [2019-09-03 19:50:09,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:50:09,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:50:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1489, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:50:09,323 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand 43 states. [2019-09-03 19:50:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:10,440 INFO L93 Difference]: Finished difference Result 258 states and 302 transitions. [2019-09-03 19:50:10,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:50:10,440 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 137 [2019-09-03 19:50:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:10,443 INFO L225 Difference]: With dead ends: 258 [2019-09-03 19:50:10,444 INFO L226 Difference]: Without dead ends: 199 [2019-09-03 19:50:10,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1905 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1201, Invalid=5441, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:50:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-03 19:50:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 146. [2019-09-03 19:50:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 19:50:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2019-09-03 19:50:10,455 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 137 [2019-09-03 19:50:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:10,456 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2019-09-03 19:50:10,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:50:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2019-09-03 19:50:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-03 19:50:10,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:10,458 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:10,458 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:10,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:10,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1553375443, now seen corresponding path program 14 times [2019-09-03 19:50:10,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:10,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:10,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:10,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:10,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 208 proven. 338 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:50:10,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:10,676 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-03 19:50:10,706 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-03 19:50:10,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:10,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:10,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:50:10,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 364 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:50:11,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:11,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 30] total 46 [2019-09-03 19:50:11,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:50:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:50:11,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1708, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:50:11,417 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 46 states. [2019-09-03 19:50:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:12,617 INFO L93 Difference]: Finished difference Result 276 states and 323 transitions. [2019-09-03 19:50:12,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 19:50:12,618 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 147 [2019-09-03 19:50:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:12,622 INFO L225 Difference]: With dead ends: 276 [2019-09-03 19:50:12,622 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 19:50:12,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2226 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1377, Invalid=6279, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:50:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 19:50:12,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 156. [2019-09-03 19:50:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-03 19:50:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2019-09-03 19:50:12,635 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 147 [2019-09-03 19:50:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:12,635 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2019-09-03 19:50:12,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:50:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2019-09-03 19:50:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 19:50:12,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:12,637 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:12,638 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:12,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:12,638 INFO L82 PathProgramCache]: Analyzing trace with hash -471144445, now seen corresponding path program 15 times [2019-09-03 19:50:12,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:12,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:12,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:12,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 238 proven. 392 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:50:12,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:12,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:12,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:12,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:50:12,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:12,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:50:12,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:50:13,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:13,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 32] total 49 [2019-09-03 19:50:13,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:50:13,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:50:13,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=1942, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:50:13,639 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 49 states. [2019-09-03 19:50:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:14,990 INFO L93 Difference]: Finished difference Result 294 states and 344 transitions. [2019-09-03 19:50:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:50:14,990 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 157 [2019-09-03 19:50:14,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:14,993 INFO L225 Difference]: With dead ends: 294 [2019-09-03 19:50:14,993 INFO L226 Difference]: Without dead ends: 227 [2019-09-03 19:50:14,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2572 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1565, Invalid=7177, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:50:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-03 19:50:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 166. [2019-09-03 19:50:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-03 19:50:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2019-09-03 19:50:15,012 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 157 [2019-09-03 19:50:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:15,012 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2019-09-03 19:50:15,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:50:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2019-09-03 19:50:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-03 19:50:15,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:15,014 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:15,014 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:15,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash 398311577, now seen corresponding path program 16 times [2019-09-03 19:50:15,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:15,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:15,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:15,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:15,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 270 proven. 450 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:50:15,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:15,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:15,335 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-03 19:50:15,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:15,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:15,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:50:15,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 480 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:50:16,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:16,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 34] total 52 [2019-09-03 19:50:16,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:50:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:50:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=2191, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:50:16,122 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand 52 states. [2019-09-03 19:50:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:17,706 INFO L93 Difference]: Finished difference Result 312 states and 365 transitions. [2019-09-03 19:50:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 19:50:17,711 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 167 [2019-09-03 19:50:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:17,713 INFO L225 Difference]: With dead ends: 312 [2019-09-03 19:50:17,713 INFO L226 Difference]: Without dead ends: 241 [2019-09-03 19:50:17,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2943 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1765, Invalid=8135, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:50:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-03 19:50:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 176. [2019-09-03 19:50:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-03 19:50:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 180 transitions. [2019-09-03 19:50:17,725 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 180 transitions. Word has length 167 [2019-09-03 19:50:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:17,725 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 180 transitions. [2019-09-03 19:50:17,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:50:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 180 transitions. [2019-09-03 19:50:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-03 19:50:17,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:17,727 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:17,727 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:17,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:17,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1322907887, now seen corresponding path program 17 times [2019-09-03 19:50:17,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:17,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:17,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 304 proven. 512 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:50:17,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:17,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:18,009 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:50:18,094 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-09-03 19:50:18,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:18,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:50:18,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 544 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:50:18,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:18,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 36] total 55 [2019-09-03 19:50:18,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:50:18,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:50:18,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=2455, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:50:18,841 INFO L87 Difference]: Start difference. First operand 176 states and 180 transitions. Second operand 55 states. [2019-09-03 19:50:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:20,453 INFO L93 Difference]: Finished difference Result 330 states and 386 transitions. [2019-09-03 19:50:20,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 19:50:20,454 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 177 [2019-09-03 19:50:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:20,457 INFO L225 Difference]: With dead ends: 330 [2019-09-03 19:50:20,457 INFO L226 Difference]: Without dead ends: 255 [2019-09-03 19:50:20,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3339 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1977, Invalid=9153, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:50:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-03 19:50:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 186. [2019-09-03 19:50:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-03 19:50:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 190 transitions. [2019-09-03 19:50:20,476 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 190 transitions. Word has length 177 [2019-09-03 19:50:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:20,476 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 190 transitions. [2019-09-03 19:50:20,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:50:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 190 transitions. [2019-09-03 19:50:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-03 19:50:20,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:20,479 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:20,479 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1717329659, now seen corresponding path program 18 times [2019-09-03 19:50:20,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:20,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:20,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:20,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:20,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 340 proven. 578 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 19:50:20,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:20,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:20,807 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:20,887 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-09-03 19:50:20,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:20,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:50:20,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 612 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 19:50:21,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:21,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 38] total 58 [2019-09-03 19:50:21,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:50:21,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:50:21,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=2734, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:50:21,855 INFO L87 Difference]: Start difference. First operand 186 states and 190 transitions. Second operand 58 states. [2019-09-03 19:50:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:23,750 INFO L93 Difference]: Finished difference Result 348 states and 407 transitions. [2019-09-03 19:50:23,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 19:50:23,751 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 187 [2019-09-03 19:50:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:23,754 INFO L225 Difference]: With dead ends: 348 [2019-09-03 19:50:23,754 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 19:50:23,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3760 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2201, Invalid=10231, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 19:50:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 19:50:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 196. [2019-09-03 19:50:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-03 19:50:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 200 transitions. [2019-09-03 19:50:23,776 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 200 transitions. Word has length 187 [2019-09-03 19:50:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:23,777 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 200 transitions. [2019-09-03 19:50:23,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:50:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2019-09-03 19:50:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-03 19:50:23,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:23,780 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:23,780 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:23,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:23,781 INFO L82 PathProgramCache]: Analyzing trace with hash 837470427, now seen corresponding path program 19 times [2019-09-03 19:50:23,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:23,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:23,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:23,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:23,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 378 proven. 648 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 19:50:24,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:24,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:24,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:24,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:50:24,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 684 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 19:50:25,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:25,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 40] total 61 [2019-09-03 19:50:25,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:50:25,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:50:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=3028, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:50:25,323 INFO L87 Difference]: Start difference. First operand 196 states and 200 transitions. Second operand 61 states. [2019-09-03 19:50:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:27,231 INFO L93 Difference]: Finished difference Result 366 states and 428 transitions. [2019-09-03 19:50:27,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 19:50:27,234 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 197 [2019-09-03 19:50:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:27,237 INFO L225 Difference]: With dead ends: 366 [2019-09-03 19:50:27,237 INFO L226 Difference]: Without dead ends: 283 [2019-09-03 19:50:27,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4206 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2437, Invalid=11369, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:50:27,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-03 19:50:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 206. [2019-09-03 19:50:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-03 19:50:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 210 transitions. [2019-09-03 19:50:27,251 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 210 transitions. Word has length 197 [2019-09-03 19:50:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:27,252 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 210 transitions. [2019-09-03 19:50:27,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:50:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 210 transitions. [2019-09-03 19:50:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-03 19:50:27,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:27,253 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:27,254 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:27,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1676378225, now seen corresponding path program 20 times [2019-09-03 19:50:27,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:27,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:27,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:27,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:27,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 418 proven. 722 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 19:50:27,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:27,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:27,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:27,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:27,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:27,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:50:27,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 760 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 19:50:28,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:28,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 42] total 64 [2019-09-03 19:50:28,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:50:28,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:50:28,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=3337, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:50:28,870 INFO L87 Difference]: Start difference. First operand 206 states and 210 transitions. Second operand 64 states. [2019-09-03 19:50:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:31,040 INFO L93 Difference]: Finished difference Result 384 states and 449 transitions. [2019-09-03 19:50:31,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 19:50:31,040 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 207 [2019-09-03 19:50:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:31,044 INFO L225 Difference]: With dead ends: 384 [2019-09-03 19:50:31,045 INFO L226 Difference]: Without dead ends: 297 [2019-09-03 19:50:31,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4677 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2685, Invalid=12567, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 19:50:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-03 19:50:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 216. [2019-09-03 19:50:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-03 19:50:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2019-09-03 19:50:31,073 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 207 [2019-09-03 19:50:31,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:31,074 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2019-09-03 19:50:31,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 19:50:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2019-09-03 19:50:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-03 19:50:31,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:31,076 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:31,077 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:31,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:31,077 INFO L82 PathProgramCache]: Analyzing trace with hash 927848391, now seen corresponding path program 21 times [2019-09-03 19:50:31,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:31,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:31,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:31,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 460 proven. 800 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 19:50:31,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:31,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:31,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:31,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 19:50:31,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:31,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:50:31,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 840 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 19:50:32,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:32,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 44] total 67 [2019-09-03 19:50:32,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 19:50:32,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 19:50:32,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=3661, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:50:32,831 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand 67 states. [2019-09-03 19:50:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:34,956 INFO L93 Difference]: Finished difference Result 402 states and 470 transitions. [2019-09-03 19:50:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 19:50:34,957 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 217 [2019-09-03 19:50:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:34,959 INFO L225 Difference]: With dead ends: 402 [2019-09-03 19:50:34,959 INFO L226 Difference]: Without dead ends: 311 [2019-09-03 19:50:34,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5173 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2945, Invalid=13825, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 19:50:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-03 19:50:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 226. [2019-09-03 19:50:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 19:50:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 230 transitions. [2019-09-03 19:50:34,974 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 230 transitions. Word has length 217 [2019-09-03 19:50:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:34,974 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 230 transitions. [2019-09-03 19:50:34,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 19:50:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 230 transitions. [2019-09-03 19:50:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-03 19:50:34,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:34,977 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:34,978 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:34,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:34,978 INFO L82 PathProgramCache]: Analyzing trace with hash -668606755, now seen corresponding path program 22 times [2019-09-03 19:50:34,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:34,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:34,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:34,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:34,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 504 proven. 882 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 19:50:35,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:35,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:35,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:50:35,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:35,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:35,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:50:35,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 924 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 19:50:37,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:37,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 46] total 70 [2019-09-03 19:50:37,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 19:50:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 19:50:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=4000, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:50:37,117 INFO L87 Difference]: Start difference. First operand 226 states and 230 transitions. Second operand 70 states. [2019-09-03 19:50:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:39,357 INFO L93 Difference]: Finished difference Result 420 states and 491 transitions. [2019-09-03 19:50:39,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 19:50:39,358 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 227 [2019-09-03 19:50:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:39,361 INFO L225 Difference]: With dead ends: 420 [2019-09-03 19:50:39,361 INFO L226 Difference]: Without dead ends: 325 [2019-09-03 19:50:39,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5694 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3217, Invalid=15143, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 19:50:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-03 19:50:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 236. [2019-09-03 19:50:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-03 19:50:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 240 transitions. [2019-09-03 19:50:39,377 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 240 transitions. Word has length 227 [2019-09-03 19:50:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:39,377 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 240 transitions. [2019-09-03 19:50:39,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 19:50:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 240 transitions. [2019-09-03 19:50:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-03 19:50:39,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:39,379 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:39,379 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1074551373, now seen corresponding path program 23 times [2019-09-03 19:50:39,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:39,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:39,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:39,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 550 proven. 968 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 19:50:39,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:39,818 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-03 19:50:39,830 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-03 19:50:39,980 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-03 19:50:39,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:39,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:50:39,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 1012 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 19:50:41,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:41,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 48] total 73 [2019-09-03 19:50:41,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 19:50:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 19:50:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=4354, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:50:41,427 INFO L87 Difference]: Start difference. First operand 236 states and 240 transitions. Second operand 73 states. [2019-09-03 19:50:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:44,052 INFO L93 Difference]: Finished difference Result 438 states and 512 transitions. [2019-09-03 19:50:44,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 19:50:44,052 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 237 [2019-09-03 19:50:44,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:44,056 INFO L225 Difference]: With dead ends: 438 [2019-09-03 19:50:44,056 INFO L226 Difference]: Without dead ends: 339 [2019-09-03 19:50:44,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6240 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3501, Invalid=16521, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 19:50:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-03 19:50:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 246. [2019-09-03 19:50:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-03 19:50:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 250 transitions. [2019-09-03 19:50:44,074 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 250 transitions. Word has length 237 [2019-09-03 19:50:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:44,074 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 250 transitions. [2019-09-03 19:50:44,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 19:50:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 250 transitions. [2019-09-03 19:50:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-03 19:50:44,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:44,076 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:44,077 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:44,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:44,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1633469367, now seen corresponding path program 24 times [2019-09-03 19:50:44,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:44,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:44,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:44,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:44,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2668 backedges. 598 proven. 1058 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 19:50:44,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:44,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:44,497 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:44,625 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2019-09-03 19:50:44,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:44,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:50:44,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2668 backedges. 1104 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 19:50:46,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:46,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 50] total 76 [2019-09-03 19:50:46,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 19:50:46,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 19:50:46,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=4723, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:50:46,043 INFO L87 Difference]: Start difference. First operand 246 states and 250 transitions. Second operand 76 states. [2019-09-03 19:50:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:48,737 INFO L93 Difference]: Finished difference Result 456 states and 533 transitions. [2019-09-03 19:50:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 19:50:48,737 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 247 [2019-09-03 19:50:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:48,741 INFO L225 Difference]: With dead ends: 456 [2019-09-03 19:50:48,741 INFO L226 Difference]: Without dead ends: 353 [2019-09-03 19:50:48,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6811 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3797, Invalid=17959, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 19:50:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-09-03 19:50:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 256. [2019-09-03 19:50:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-03 19:50:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 260 transitions. [2019-09-03 19:50:48,759 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 260 transitions. Word has length 247 [2019-09-03 19:50:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:48,759 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 260 transitions. [2019-09-03 19:50:48,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 19:50:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 260 transitions. [2019-09-03 19:50:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-03 19:50:48,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:48,761 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:48,762 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:48,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash 59552415, now seen corresponding path program 25 times [2019-09-03 19:50:48,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:48,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:48,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2904 backedges. 648 proven. 1152 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 19:50:49,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:49,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:49,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:49,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:50:49,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2904 backedges. 1200 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 19:50:50,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:50,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 52] total 79 [2019-09-03 19:50:50,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 19:50:50,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 19:50:50,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=5107, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:50:50,933 INFO L87 Difference]: Start difference. First operand 256 states and 260 transitions. Second operand 79 states. [2019-09-03 19:50:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:53,558 INFO L93 Difference]: Finished difference Result 474 states and 554 transitions. [2019-09-03 19:50:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 19:50:53,559 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 257 [2019-09-03 19:50:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:53,562 INFO L225 Difference]: With dead ends: 474 [2019-09-03 19:50:53,562 INFO L226 Difference]: Without dead ends: 367 [2019-09-03 19:50:53,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7407 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4105, Invalid=19457, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 19:50:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-09-03 19:50:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 266. [2019-09-03 19:50:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-03 19:50:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 270 transitions. [2019-09-03 19:50:53,580 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 270 transitions. Word has length 257 [2019-09-03 19:50:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:53,580 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 270 transitions. [2019-09-03 19:50:53,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 19:50:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 270 transitions. [2019-09-03 19:50:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-03 19:50:53,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:53,583 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:53,583 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:53,583 INFO L82 PathProgramCache]: Analyzing trace with hash -965470027, now seen corresponding path program 26 times [2019-09-03 19:50:53,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:53,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:53,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:53,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:53,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 700 proven. 1250 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 19:50:54,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:54,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:54,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:54,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:54,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:54,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:50:54,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 1300 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 19:50:55,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:55,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 54] total 82 [2019-09-03 19:50:55,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 19:50:55,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 19:50:55,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=5506, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:50:55,930 INFO L87 Difference]: Start difference. First operand 266 states and 270 transitions. Second operand 82 states. [2019-09-03 19:50:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:58,888 INFO L93 Difference]: Finished difference Result 492 states and 575 transitions. [2019-09-03 19:50:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-03 19:50:58,888 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 267 [2019-09-03 19:50:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:58,891 INFO L225 Difference]: With dead ends: 492 [2019-09-03 19:50:58,891 INFO L226 Difference]: Without dead ends: 381 [2019-09-03 19:50:58,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8028 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4425, Invalid=21015, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 19:50:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-03 19:50:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 276. [2019-09-03 19:50:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-03 19:50:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2019-09-03 19:50:58,911 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 267 [2019-09-03 19:50:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:58,912 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2019-09-03 19:50:58,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 19:50:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2019-09-03 19:50:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-03 19:50:58,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:58,914 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:58,914 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:58,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash 814317195, now seen corresponding path program 27 times [2019-09-03 19:50:58,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:58,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:58,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:58,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3406 backedges. 754 proven. 1352 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 19:50:59,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50: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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:59,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:59,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 19:50:59,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:59,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:50:59,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3406 backedges. 1404 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 19:51:01,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:01,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 56] total 85 [2019-09-03 19:51:01,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 19:51:01,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 19:51:01,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=5920, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:51:01,417 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 85 states. [2019-09-03 19:51:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:04,384 INFO L93 Difference]: Finished difference Result 510 states and 596 transitions. [2019-09-03 19:51:04,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-03 19:51:04,388 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 277 [2019-09-03 19:51:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:04,391 INFO L225 Difference]: With dead ends: 510 [2019-09-03 19:51:04,391 INFO L226 Difference]: Without dead ends: 395 [2019-09-03 19:51:04,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8674 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4757, Invalid=22633, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 19:51:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-03 19:51:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 286. [2019-09-03 19:51:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-03 19:51:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 290 transitions. [2019-09-03 19:51:04,409 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 290 transitions. Word has length 277 [2019-09-03 19:51:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:04,410 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 290 transitions. [2019-09-03 19:51:04,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 19:51:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 290 transitions. [2019-09-03 19:51:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-03 19:51:04,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:04,412 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:04,412 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash -446106591, now seen corresponding path program 28 times [2019-09-03 19:51:04,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:04,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:04,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3672 backedges. 810 proven. 1458 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 19:51:05,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:05,089 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-03 19:51:05,109 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-03 19:51:05,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:05,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:05,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 19:51:05,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3672 backedges. 1512 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 19:51:07,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:07,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 58] total 88 [2019-09-03 19:51:07,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 19:51:07,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 19:51:07,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=6349, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:51:07,130 INFO L87 Difference]: Start difference. First operand 286 states and 290 transitions. Second operand 88 states. [2019-09-03 19:51:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:10,237 INFO L93 Difference]: Finished difference Result 528 states and 617 transitions. [2019-09-03 19:51:10,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 19:51:10,237 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 287 [2019-09-03 19:51:10,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:10,239 INFO L225 Difference]: With dead ends: 528 [2019-09-03 19:51:10,239 INFO L226 Difference]: Without dead ends: 409 [2019-09-03 19:51:10,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9345 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5101, Invalid=24311, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 19:51:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-09-03 19:51:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 296. [2019-09-03 19:51:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 19:51:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 300 transitions. [2019-09-03 19:51:10,259 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 300 transitions. Word has length 287 [2019-09-03 19:51:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:10,259 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 300 transitions. [2019-09-03 19:51:10,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 19:51:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 300 transitions. [2019-09-03 19:51:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-03 19:51:10,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:10,262 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:10,262 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1944417929, now seen corresponding path program 29 times [2019-09-03 19:51:10,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:10,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:10,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:10,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 868 proven. 1568 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 19:51:11,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:11,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:11,098 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:11,269 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-09-03 19:51:11,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:11,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:51:11,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 1624 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 19:51:13,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:13,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 60] total 91 [2019-09-03 19:51:13,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 19:51:13,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 19:51:13,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=6793, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:51:13,273 INFO L87 Difference]: Start difference. First operand 296 states and 300 transitions. Second operand 91 states. [2019-09-03 19:51:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:16,388 INFO L93 Difference]: Finished difference Result 546 states and 638 transitions. [2019-09-03 19:51:16,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-03 19:51:16,388 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 297 [2019-09-03 19:51:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:16,391 INFO L225 Difference]: With dead ends: 546 [2019-09-03 19:51:16,392 INFO L226 Difference]: Without dead ends: 423 [2019-09-03 19:51:16,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10041 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5457, Invalid=26049, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 19:51:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-09-03 19:51:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 306. [2019-09-03 19:51:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-03 19:51:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 310 transitions. [2019-09-03 19:51:16,413 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 310 transitions. Word has length 297 [2019-09-03 19:51:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:16,414 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 310 transitions. [2019-09-03 19:51:16,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 19:51:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 310 transitions. [2019-09-03 19:51:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-03 19:51:16,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:16,416 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:16,416 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:16,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:16,417 INFO L82 PathProgramCache]: Analyzing trace with hash 940723853, now seen corresponding path program 30 times [2019-09-03 19:51:16,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:16,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:16,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 928 proven. 1682 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 19:51:17,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:17,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:17,105 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:17,255 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2019-09-03 19:51:17,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:17,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:51:17,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 1740 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 19:51:19,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:19,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 62] total 94 [2019-09-03 19:51:19,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 19:51:19,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 19:51:19,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=7252, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:51:19,284 INFO L87 Difference]: Start difference. First operand 306 states and 310 transitions. Second operand 94 states. [2019-09-03 19:51:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:22,777 INFO L93 Difference]: Finished difference Result 564 states and 659 transitions. [2019-09-03 19:51:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-03 19:51:22,777 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 307 [2019-09-03 19:51:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:22,779 INFO L225 Difference]: With dead ends: 564 [2019-09-03 19:51:22,780 INFO L226 Difference]: Without dead ends: 437 [2019-09-03 19:51:22,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10762 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5825, Invalid=27847, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 19:51:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-03 19:51:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 316. [2019-09-03 19:51:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-03 19:51:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 320 transitions. [2019-09-03 19:51:22,801 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 320 transitions. Word has length 307 [2019-09-03 19:51:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:22,801 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 320 transitions. [2019-09-03 19:51:22,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 19:51:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 320 transitions. [2019-09-03 19:51:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-03 19:51:22,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:22,804 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:22,804 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:22,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1842326685, now seen corresponding path program 31 times [2019-09-03 19:51:22,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:22,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:22,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:22,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 990 proven. 1800 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 19:51:23,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:23,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:23,424 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-03 19:51:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:23,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:51:23,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 1860 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 19:51:26,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:26,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 64] total 97 [2019-09-03 19:51:26,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 19:51:26,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 19:51:26,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=7726, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:51:26,170 INFO L87 Difference]: Start difference. First operand 316 states and 320 transitions. Second operand 97 states. [2019-09-03 19:51:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:29,791 INFO L93 Difference]: Finished difference Result 582 states and 680 transitions. [2019-09-03 19:51:29,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-03 19:51:29,792 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 317 [2019-09-03 19:51:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:29,795 INFO L225 Difference]: With dead ends: 582 [2019-09-03 19:51:29,795 INFO L226 Difference]: Without dead ends: 451 [2019-09-03 19:51:29,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11508 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6205, Invalid=29705, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 19:51:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-03 19:51:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 326. [2019-09-03 19:51:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-03 19:51:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 330 transitions. [2019-09-03 19:51:29,816 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 330 transitions. Word has length 317 [2019-09-03 19:51:29,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:29,816 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 330 transitions. [2019-09-03 19:51:29,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 19:51:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 330 transitions. [2019-09-03 19:51:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-03 19:51:29,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:29,819 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:29,819 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:29,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1044338695, now seen corresponding path program 32 times [2019-09-03 19:51:29,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:29,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:29,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:29,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4836 backedges. 1054 proven. 1922 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 19:51:30,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:30,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:30,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:30,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:30,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:30,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 19:51:30,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4836 backedges. 1984 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 19:51:33,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:33,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 66] total 100 [2019-09-03 19:51:33,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 19:51:33,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 19:51:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=8215, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:51:33,518 INFO L87 Difference]: Start difference. First operand 326 states and 330 transitions. Second operand 100 states. [2019-09-03 19:51:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:37,844 INFO L93 Difference]: Finished difference Result 600 states and 701 transitions. [2019-09-03 19:51:37,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-03 19:51:37,845 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 327 [2019-09-03 19:51:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:37,848 INFO L225 Difference]: With dead ends: 600 [2019-09-03 19:51:37,848 INFO L226 Difference]: Without dead ends: 465 [2019-09-03 19:51:37,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12279 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6597, Invalid=31623, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 19:51:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-03 19:51:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 336. [2019-09-03 19:51:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-03 19:51:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 340 transitions. [2019-09-03 19:51:37,883 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 340 transitions. Word has length 327 [2019-09-03 19:51:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:37,884 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 340 transitions. [2019-09-03 19:51:37,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 19:51:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 340 transitions. [2019-09-03 19:51:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-03 19:51:37,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:37,888 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:37,889 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash 360406095, now seen corresponding path program 33 times [2019-09-03 19:51:37,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:37,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:37,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:37,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:37,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5152 backedges. 1120 proven. 2048 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 19:51:39,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:39,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:39,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:39,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 19:51:39,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:39,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 19:51:39,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5152 backedges. 2112 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 19:51:42,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:42,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 68] total 103 [2019-09-03 19:51:42,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 19:51:42,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 19:51:42,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1787, Invalid=8719, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 19:51:42,710 INFO L87 Difference]: Start difference. First operand 336 states and 340 transitions. Second operand 103 states. [2019-09-03 19:51:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:47,059 INFO L93 Difference]: Finished difference Result 618 states and 722 transitions. [2019-09-03 19:51:47,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-03 19:51:47,060 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 337 [2019-09-03 19:51:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:47,063 INFO L225 Difference]: With dead ends: 618 [2019-09-03 19:51:47,063 INFO L226 Difference]: Without dead ends: 479 [2019-09-03 19:51:47,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13075 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7001, Invalid=33601, Unknown=0, NotChecked=0, Total=40602 [2019-09-03 19:51:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-03 19:51:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 346. [2019-09-03 19:51:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-03 19:51:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2019-09-03 19:51:47,085 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 337 [2019-09-03 19:51:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:47,085 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2019-09-03 19:51:47,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 19:51:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2019-09-03 19:51:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-03 19:51:47,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:47,088 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:47,088 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:47,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1820622949, now seen corresponding path program 34 times [2019-09-03 19:51:47,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:47,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:47,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:47,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:47,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 1188 proven. 2178 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 19:51:48,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:48,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:48,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:48,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:48,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:48,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:51:48,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 2244 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 19:51:51,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:51,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 70] total 106 [2019-09-03 19:51:51,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-03 19:51:51,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-03 19:51:51,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=9238, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:51:51,240 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 106 states. [2019-09-03 19:51:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:55,366 INFO L93 Difference]: Finished difference Result 636 states and 743 transitions. [2019-09-03 19:51:55,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-03 19:51:55,366 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 347 [2019-09-03 19:51:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:55,370 INFO L225 Difference]: With dead ends: 636 [2019-09-03 19:51:55,370 INFO L226 Difference]: Without dead ends: 493 [2019-09-03 19:51:55,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13896 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7417, Invalid=35639, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 19:51:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-03 19:51:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 356. [2019-09-03 19:51:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-03 19:51:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 360 transitions. [2019-09-03 19:51:55,394 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 360 transitions. Word has length 347 [2019-09-03 19:51:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:55,395 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 360 transitions. [2019-09-03 19:51:55,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-03 19:51:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 360 transitions. [2019-09-03 19:51:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-03 19:51:55,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:55,397 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:55,398 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:55,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:55,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1600922683, now seen corresponding path program 35 times [2019-09-03 19:51:55,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:55,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:55,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:55,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:55,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 1258 proven. 2312 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 19:51:56,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:56,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:56,152 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:56,345 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-09-03 19:51:56,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:56,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 19:51:56,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2380 proven. 1190 refuted. 0 times theorem prover too weak. 2244 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-03 19:51:59,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:59,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 72] total 109 [2019-09-03 19:51:59,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 19:51:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 19:51:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=9772, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 19:51:59,282 INFO L87 Difference]: Start difference. First operand 356 states and 360 transitions. Second operand 109 states. [2019-09-03 19:52:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:03,987 INFO L93 Difference]: Finished difference Result 654 states and 764 transitions. [2019-09-03 19:52:03,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-03 19:52:03,988 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 357 [2019-09-03 19:52:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:03,991 INFO L225 Difference]: With dead ends: 654 [2019-09-03 19:52:03,992 INFO L226 Difference]: Without dead ends: 507 [2019-09-03 19:52:03,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14742 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7845, Invalid=37737, Unknown=0, NotChecked=0, Total=45582 [2019-09-03 19:52:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-03 19:52:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 366. [2019-09-03 19:52:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-03 19:52:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 370 transitions. [2019-09-03 19:52:04,015 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 370 transitions. Word has length 357 [2019-09-03 19:52:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:04,015 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 370 transitions. [2019-09-03 19:52:04,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 19:52:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 370 transitions. [2019-09-03 19:52:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-03 19:52:04,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:04,018 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:04,018 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:04,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:04,019 INFO L82 PathProgramCache]: Analyzing trace with hash 690902993, now seen corresponding path program 36 times [2019-09-03 19:52:04,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:04,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:04,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:04,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1330 proven. 2450 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 19:52:04,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:04,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:05,010 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:05,248 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2019-09-03 19:52:05,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:05,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 19:52:05,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2520 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 19:52:08,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:08,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 74] total 112 [2019-09-03 19:52:08,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-03 19:52:08,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-03 19:52:08,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=10321, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 19:52:08,179 INFO L87 Difference]: Start difference. First operand 366 states and 370 transitions. Second operand 112 states. [2019-09-03 19:52:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:12,787 INFO L93 Difference]: Finished difference Result 672 states and 785 transitions. [2019-09-03 19:52:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-03 19:52:12,788 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 367 [2019-09-03 19:52:12,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:12,791 INFO L225 Difference]: With dead ends: 672 [2019-09-03 19:52:12,792 INFO L226 Difference]: Without dead ends: 521 [2019-09-03 19:52:12,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15613 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8285, Invalid=39895, Unknown=0, NotChecked=0, Total=48180 [2019-09-03 19:52:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-09-03 19:52:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 376. [2019-09-03 19:52:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-03 19:52:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 380 transitions. [2019-09-03 19:52:12,819 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 380 transitions. Word has length 367 [2019-09-03 19:52:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:12,819 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 380 transitions. [2019-09-03 19:52:12,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-03 19:52:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 380 transitions. [2019-09-03 19:52:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-03 19:52:12,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:12,822 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:12,822 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:12,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1345530663, now seen corresponding path program 37 times [2019-09-03 19:52:12,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:12,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:12,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:12,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:12,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6516 backedges. 1404 proven. 2592 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 19:52:13,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:13,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:13,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:13,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 19:52:13,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6516 backedges. 2664 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 19:52:16,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:16,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 76] total 115 [2019-09-03 19:52:16,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 19:52:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 19:52:16,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=10885, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 19:52:16,887 INFO L87 Difference]: Start difference. First operand 376 states and 380 transitions. Second operand 115 states. [2019-09-03 19:52:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:21,981 INFO L93 Difference]: Finished difference Result 690 states and 806 transitions. [2019-09-03 19:52:21,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-03 19:52:21,982 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 377 [2019-09-03 19:52:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:21,984 INFO L225 Difference]: With dead ends: 690 [2019-09-03 19:52:21,984 INFO L226 Difference]: Without dead ends: 535 [2019-09-03 19:52:21,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16509 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8737, Invalid=42113, Unknown=0, NotChecked=0, Total=50850 [2019-09-03 19:52:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-03 19:52:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 386. [2019-09-03 19:52:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-09-03 19:52:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 390 transitions. [2019-09-03 19:52:22,010 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 390 transitions. Word has length 377 [2019-09-03 19:52:22,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:22,011 INFO L475 AbstractCegarLoop]: Abstraction has 386 states and 390 transitions. [2019-09-03 19:52:22,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 19:52:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 390 transitions. [2019-09-03 19:52:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-03 19:52:22,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:22,014 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:22,014 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:22,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash 256814653, now seen corresponding path program 38 times [2019-09-03 19:52:22,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:22,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:22,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:22,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:22,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6882 backedges. 1480 proven. 2738 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 19:52:23,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:23,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:23,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:23,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:23,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:23,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 19:52:23,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6882 backedges. 2812 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 19:52:26,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:26,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 78] total 118 [2019-09-03 19:52:26,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-03 19:52:26,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-03 19:52:26,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2342, Invalid=11464, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:52:26,381 INFO L87 Difference]: Start difference. First operand 386 states and 390 transitions. Second operand 118 states. [2019-09-03 19:52:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:31,252 INFO L93 Difference]: Finished difference Result 708 states and 827 transitions. [2019-09-03 19:52:31,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-03 19:52:31,253 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 387 [2019-09-03 19:52:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:31,257 INFO L225 Difference]: With dead ends: 708 [2019-09-03 19:52:31,257 INFO L226 Difference]: Without dead ends: 549 [2019-09-03 19:52:31,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17430 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9201, Invalid=44391, Unknown=0, NotChecked=0, Total=53592 [2019-09-03 19:52:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-03 19:52:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 396. [2019-09-03 19:52:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-09-03 19:52:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 400 transitions. [2019-09-03 19:52:31,286 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 400 transitions. Word has length 387 [2019-09-03 19:52:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:31,286 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 400 transitions. [2019-09-03 19:52:31,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-03 19:52:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 400 transitions. [2019-09-03 19:52:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-03 19:52:31,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:31,289 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:31,290 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2126573843, now seen corresponding path program 39 times [2019-09-03 19:52:31,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:31,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:31,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:31,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7258 backedges. 1558 proven. 2888 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 19:52:32,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:32,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:32,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:32,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-03 19:52:32,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:32,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 19:52:32,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7258 backedges. 2964 proven. 1482 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 19:52:35,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:35,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 80] total 121 [2019-09-03 19:52:35,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-03 19:52:35,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-03 19:52:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2462, Invalid=12058, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 19:52:35,674 INFO L87 Difference]: Start difference. First operand 396 states and 400 transitions. Second operand 121 states. [2019-09-03 19:52:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:40,930 INFO L93 Difference]: Finished difference Result 726 states and 848 transitions. [2019-09-03 19:52:40,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-03 19:52:40,930 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 397 [2019-09-03 19:52:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:40,933 INFO L225 Difference]: With dead ends: 726 [2019-09-03 19:52:40,933 INFO L226 Difference]: Without dead ends: 563 [2019-09-03 19:52:40,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18376 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9677, Invalid=46729, Unknown=0, NotChecked=0, Total=56406 [2019-09-03 19:52:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-03 19:52:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 406. [2019-09-03 19:52:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-09-03 19:52:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 410 transitions. [2019-09-03 19:52:40,960 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 410 transitions. Word has length 397 [2019-09-03 19:52:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:40,961 INFO L475 AbstractCegarLoop]: Abstraction has 406 states and 410 transitions. [2019-09-03 19:52:40,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-03 19:52:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 410 transitions. [2019-09-03 19:52:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-09-03 19:52:40,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:40,964 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:40,964 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2100691881, now seen corresponding path program 40 times [2019-09-03 19:52:40,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:40,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7644 backedges. 1638 proven. 3042 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 19:52:41,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:41,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:41,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:42,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:42,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:42,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 19:52:42,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7644 backedges. 3120 proven. 1560 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 19:52:45,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:45,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 82] total 124 [2019-09-03 19:52:45,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-03 19:52:45,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-03 19:52:45,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2585, Invalid=12667, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 19:52:45,539 INFO L87 Difference]: Start difference. First operand 406 states and 410 transitions. Second operand 124 states. [2019-09-03 19:52:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:51,420 INFO L93 Difference]: Finished difference Result 744 states and 869 transitions. [2019-09-03 19:52:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-09-03 19:52:51,420 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 407 [2019-09-03 19:52:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:51,424 INFO L225 Difference]: With dead ends: 744 [2019-09-03 19:52:51,424 INFO L226 Difference]: Without dead ends: 577 [2019-09-03 19:52:51,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19347 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10165, Invalid=49127, Unknown=0, NotChecked=0, Total=59292 [2019-09-03 19:52:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-03 19:52:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 416. [2019-09-03 19:52:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-03 19:52:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 420 transitions. [2019-09-03 19:52:51,453 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 420 transitions. Word has length 407 [2019-09-03 19:52:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:51,454 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 420 transitions. [2019-09-03 19:52:51,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-03 19:52:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 420 transitions. [2019-09-03 19:52:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-03 19:52:51,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:51,457 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:51,457 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1489368575, now seen corresponding path program 41 times [2019-09-03 19:52:51,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:51,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:51,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 1720 proven. 3200 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 19:52:52,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:52,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:52,433 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:52,636 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-09-03 19:52:52,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:52,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 19:52:52,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 3280 proven. 1640 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 19:52:56,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:56,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 84] total 127 [2019-09-03 19:52:56,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-03 19:52:56,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-03 19:52:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=13291, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 19:52:56,250 INFO L87 Difference]: Start difference. First operand 416 states and 420 transitions. Second operand 127 states. [2019-09-03 19:53:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:01,963 INFO L93 Difference]: Finished difference Result 762 states and 890 transitions. [2019-09-03 19:53:01,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-09-03 19:53:01,964 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 417 [2019-09-03 19:53:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:01,966 INFO L225 Difference]: With dead ends: 762 [2019-09-03 19:53:01,966 INFO L226 Difference]: Without dead ends: 591 [2019-09-03 19:53:01,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20343 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10665, Invalid=51585, Unknown=0, NotChecked=0, Total=62250 [2019-09-03 19:53:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-03 19:53:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 426. [2019-09-03 19:53:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-03 19:53:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 430 transitions. [2019-09-03 19:53:01,995 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 430 transitions. Word has length 417 [2019-09-03 19:53:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:01,996 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 430 transitions. [2019-09-03 19:53:01,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-03 19:53:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 430 transitions. [2019-09-03 19:53:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-09-03 19:53:01,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:01,999 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:01,999 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash 938792981, now seen corresponding path program 42 times [2019-09-03 19:53:02,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:02,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:02,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8446 backedges. 1804 proven. 3362 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 19:53:03,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:03,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:03,056 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:03,267 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) [2019-09-03 19:53:03,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:03,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 19:53:03,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8446 backedges. 3444 proven. 1722 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 19:53:07,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:07,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 86] total 130 [2019-09-03 19:53:07,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-03 19:53:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-03 19:53:07,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2840, Invalid=13930, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 19:53:07,041 INFO L87 Difference]: Start difference. First operand 426 states and 430 transitions. Second operand 130 states. [2019-09-03 19:53:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:12,874 INFO L93 Difference]: Finished difference Result 780 states and 911 transitions. [2019-09-03 19:53:12,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-09-03 19:53:12,874 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 427 [2019-09-03 19:53:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:12,877 INFO L225 Difference]: With dead ends: 780 [2019-09-03 19:53:12,877 INFO L226 Difference]: Without dead ends: 605 [2019-09-03 19:53:12,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21364 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=11177, Invalid=54103, Unknown=0, NotChecked=0, Total=65280 [2019-09-03 19:53:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-03 19:53:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 436. [2019-09-03 19:53:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-09-03 19:53:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 440 transitions. [2019-09-03 19:53:12,908 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 440 transitions. Word has length 427 [2019-09-03 19:53:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:12,908 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 440 transitions. [2019-09-03 19:53:12,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-03 19:53:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 440 transitions. [2019-09-03 19:53:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-03 19:53:12,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:12,912 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:12,912 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1119009259, now seen corresponding path program 43 times [2019-09-03 19:53:12,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:12,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:12,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:12,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:12,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8862 backedges. 1890 proven. 3528 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 19:53:13,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:13,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:14,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:14,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 19:53:14,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8862 backedges. 3612 proven. 1806 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 19:53:18,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:18,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 88] total 133 [2019-09-03 19:53:18,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-03 19:53:18,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-03 19:53:18,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=14584, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 19:53:18,051 INFO L87 Difference]: Start difference. First operand 436 states and 440 transitions. Second operand 133 states. [2019-09-03 19:53:24,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:24,471 INFO L93 Difference]: Finished difference Result 798 states and 932 transitions. [2019-09-03 19:53:24,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-09-03 19:53:24,471 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 437 [2019-09-03 19:53:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:24,474 INFO L225 Difference]: With dead ends: 798 [2019-09-03 19:53:24,474 INFO L226 Difference]: Without dead ends: 619 [2019-09-03 19:53:24,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22410 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11701, Invalid=56681, Unknown=0, NotChecked=0, Total=68382 [2019-09-03 19:53:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-09-03 19:53:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 446. [2019-09-03 19:53:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-03 19:53:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 450 transitions. [2019-09-03 19:53:24,504 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 450 transitions. Word has length 437 [2019-09-03 19:53:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:24,504 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 450 transitions. [2019-09-03 19:53:24,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-03 19:53:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 450 transitions. [2019-09-03 19:53:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-09-03 19:53:24,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:24,508 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:24,508 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:24,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:24,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1956926591, now seen corresponding path program 44 times [2019-09-03 19:53:24,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:24,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:24,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:24,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:24,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 1978 proven. 3698 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 19:53:25,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:25,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:25,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:25,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:25,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:25,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 19:53:25,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 3784 proven. 1892 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 19:53:29,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:29,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 90] total 136 [2019-09-03 19:53:29,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-03 19:53:29,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-03 19:53:29,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3107, Invalid=15253, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 19:53:29,877 INFO L87 Difference]: Start difference. First operand 446 states and 450 transitions. Second operand 136 states. [2019-09-03 19:53:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:36,177 INFO L93 Difference]: Finished difference Result 816 states and 953 transitions. [2019-09-03 19:53:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-09-03 19:53:36,178 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 447 [2019-09-03 19:53:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:36,182 INFO L225 Difference]: With dead ends: 816 [2019-09-03 19:53:36,182 INFO L226 Difference]: Without dead ends: 633 [2019-09-03 19:53:36,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23481 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=12237, Invalid=59319, Unknown=0, NotChecked=0, Total=71556 [2019-09-03 19:53:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-03 19:53:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 456. [2019-09-03 19:53:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-03 19:53:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 460 transitions. [2019-09-03 19:53:36,213 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 460 transitions. Word has length 447 [2019-09-03 19:53:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:36,213 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 460 transitions. [2019-09-03 19:53:36,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-03 19:53:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 460 transitions. [2019-09-03 19:53:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2019-09-03 19:53:36,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:36,217 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:36,218 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1212695337, now seen corresponding path program 45 times [2019-09-03 19:53:36,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:36,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:36,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9724 backedges. 2068 proven. 3872 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 19:53:37,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:37,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:53:37,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:37,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-03 19:53:37,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:37,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 19:53:37,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9724 backedges. 3960 proven. 1980 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 19:53:41,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:41,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 92] total 139 [2019-09-03 19:53:41,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-03 19:53:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-03 19:53:41,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=15937, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 19:53:41,927 INFO L87 Difference]: Start difference. First operand 456 states and 460 transitions. Second operand 139 states. [2019-09-03 19:53:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:48,774 INFO L93 Difference]: Finished difference Result 834 states and 974 transitions. [2019-09-03 19:53:48,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-09-03 19:53:48,774 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 457 [2019-09-03 19:53:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:48,778 INFO L225 Difference]: With dead ends: 834 [2019-09-03 19:53:48,778 INFO L226 Difference]: Without dead ends: 647 [2019-09-03 19:53:48,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24577 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12785, Invalid=62017, Unknown=0, NotChecked=0, Total=74802 [2019-09-03 19:53:48,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-03 19:53:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 466. [2019-09-03 19:53:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-03 19:53:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 470 transitions. [2019-09-03 19:53:48,809 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 470 transitions. Word has length 457 [2019-09-03 19:53:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:48,810 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 470 transitions. [2019-09-03 19:53:48,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-03 19:53:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 470 transitions. [2019-09-03 19:53:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-03 19:53:48,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:48,813 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:48,814 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:48,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:48,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1778056685, now seen corresponding path program 46 times [2019-09-03 19:53:48,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:48,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:48,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:48,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10170 backedges. 2160 proven. 4050 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 19:53:49,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:49,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:49,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:50,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:50,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:50,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 19:53:50,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10170 backedges. 4140 proven. 2070 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 19:53:54,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:54,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 94] total 142 [2019-09-03 19:53:54,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-03 19:53:54,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-03 19:53:54,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3386, Invalid=16636, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 19:53:54,605 INFO L87 Difference]: Start difference. First operand 466 states and 470 transitions. Second operand 142 states. [2019-09-03 19:54:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:01,446 INFO L93 Difference]: Finished difference Result 852 states and 995 transitions. [2019-09-03 19:54:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2019-09-03 19:54:01,446 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 467 [2019-09-03 19:54:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:01,449 INFO L225 Difference]: With dead ends: 852 [2019-09-03 19:54:01,449 INFO L226 Difference]: Without dead ends: 661 [2019-09-03 19:54:01,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25698 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13345, Invalid=64775, Unknown=0, NotChecked=0, Total=78120 [2019-09-03 19:54:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-03 19:54:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 476. [2019-09-03 19:54:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-09-03 19:54:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 480 transitions. [2019-09-03 19:54:01,483 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 480 transitions. Word has length 467 [2019-09-03 19:54:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:01,483 INFO L475 AbstractCegarLoop]: Abstraction has 476 states and 480 transitions. [2019-09-03 19:54:01,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-03 19:54:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 480 transitions. [2019-09-03 19:54:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-03 19:54:01,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:01,487 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:01,488 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1774550723, now seen corresponding path program 47 times [2019-09-03 19:54:01,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:01,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:01,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:01,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:01,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 2254 proven. 4232 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 19:54:02,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:02,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:02,798 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:03,062 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-09-03 19:54:03,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:03,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 19:54:03,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 4324 proven. 2162 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 19:54:07,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:07,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 96] total 145 [2019-09-03 19:54:07,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-03 19:54:07,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-03 19:54:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3530, Invalid=17350, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 19:54:07,828 INFO L87 Difference]: Start difference. First operand 476 states and 480 transitions. Second operand 145 states. [2019-09-03 19:54:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:14,637 INFO L93 Difference]: Finished difference Result 870 states and 1016 transitions. [2019-09-03 19:54:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2019-09-03 19:54:14,638 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 477 [2019-09-03 19:54:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:14,674 INFO L225 Difference]: With dead ends: 870 [2019-09-03 19:54:14,674 INFO L226 Difference]: Without dead ends: 675 [2019-09-03 19:54:14,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26844 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13917, Invalid=67593, Unknown=0, NotChecked=0, Total=81510 [2019-09-03 19:54:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-03 19:54:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 486. [2019-09-03 19:54:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-09-03 19:54:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 490 transitions. [2019-09-03 19:54:14,709 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 490 transitions. Word has length 477 [2019-09-03 19:54:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:14,710 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 490 transitions. [2019-09-03 19:54:14,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-03 19:54:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 490 transitions. [2019-09-03 19:54:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-03 19:54:14,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:14,714 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:14,715 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:14,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:14,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1927065767, now seen corresponding path program 48 times [2019-09-03 19:54:14,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:14,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:14,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:14,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:14,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 11092 backedges. 2350 proven. 4418 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 19:54:16,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:16,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:16,080 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:16,340 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2019-09-03 19:54:16,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:16,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:54:16,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11092 backedges. 4512 proven. 2256 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 19:54:21,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:21,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 98] total 148 [2019-09-03 19:54:21,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-03 19:54:21,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-03 19:54:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3677, Invalid=18079, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 19:54:21,203 INFO L87 Difference]: Start difference. First operand 486 states and 490 transitions. Second operand 148 states. [2019-09-03 19:54:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:29,208 INFO L93 Difference]: Finished difference Result 888 states and 1037 transitions. [2019-09-03 19:54:29,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2019-09-03 19:54:29,208 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 487 [2019-09-03 19:54:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:29,212 INFO L225 Difference]: With dead ends: 888 [2019-09-03 19:54:29,212 INFO L226 Difference]: Without dead ends: 689 [2019-09-03 19:54:29,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28015 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=14501, Invalid=70471, Unknown=0, NotChecked=0, Total=84972 [2019-09-03 19:54:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-09-03 19:54:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 496. [2019-09-03 19:54:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-03 19:54:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 500 transitions. [2019-09-03 19:54:29,238 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 500 transitions. Word has length 487 [2019-09-03 19:54:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:29,238 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 500 transitions. [2019-09-03 19:54:29,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-03 19:54:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 500 transitions. [2019-09-03 19:54:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-03 19:54:29,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:29,242 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:29,243 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1636597679, now seen corresponding path program 49 times [2019-09-03 19:54:29,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:29,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:29,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11568 backedges. 2448 proven. 4608 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 19:54:30,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:30,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:54:30,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:30,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 19:54:30,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 11568 backedges. 4704 proven. 2352 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 19:54:35,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:35,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 100] total 151 [2019-09-03 19:54:35,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-03 19:54:35,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-03 19:54:35,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=18823, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 19:54:35,758 INFO L87 Difference]: Start difference. First operand 496 states and 500 transitions. Second operand 151 states. [2019-09-03 19:54:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:43,303 INFO L93 Difference]: Finished difference Result 906 states and 1058 transitions. [2019-09-03 19:54:43,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2019-09-03 19:54:43,303 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 497 [2019-09-03 19:54:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:43,307 INFO L225 Difference]: With dead ends: 906 [2019-09-03 19:54:43,307 INFO L226 Difference]: Without dead ends: 703 [2019-09-03 19:54:43,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29211 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=15097, Invalid=73409, Unknown=0, NotChecked=0, Total=88506 [2019-09-03 19:54:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-09-03 19:54:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 506. [2019-09-03 19:54:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-09-03 19:54:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 510 transitions. [2019-09-03 19:54:43,340 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 510 transitions. Word has length 497 [2019-09-03 19:54:43,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:43,340 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 510 transitions. [2019-09-03 19:54:43,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-03 19:54:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 510 transitions. [2019-09-03 19:54:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-03 19:54:43,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:43,345 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:43,345 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:43,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:43,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1796923451, now seen corresponding path program 50 times [2019-09-03 19:54:43,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:43,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:43,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:43,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:43,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12054 backedges. 2548 proven. 4802 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 19:54:44,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:44,862 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-03 19:54:44,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:45,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:45,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:45,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 19:54:45,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12054 backedges. 4900 proven. 2450 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 19:54:50,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:50,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 102] total 154 [2019-09-03 19:54:50,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-03 19:54:50,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-03 19:54:50,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3980, Invalid=19582, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 19:54:50,292 INFO L87 Difference]: Start difference. First operand 506 states and 510 transitions. Second operand 154 states. [2019-09-03 19:54:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:58,354 INFO L93 Difference]: Finished difference Result 924 states and 1079 transitions. [2019-09-03 19:54:58,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2019-09-03 19:54:58,354 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 507 [2019-09-03 19:54:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:58,358 INFO L225 Difference]: With dead ends: 924 [2019-09-03 19:54:58,359 INFO L226 Difference]: Without dead ends: 717 [2019-09-03 19:54:58,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30432 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=15705, Invalid=76407, Unknown=0, NotChecked=0, Total=92112 [2019-09-03 19:54:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-03 19:54:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 516. [2019-09-03 19:54:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-03 19:54:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 520 transitions. [2019-09-03 19:54:58,397 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 520 transitions. Word has length 507 [2019-09-03 19:54:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:58,397 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 520 transitions. [2019-09-03 19:54:58,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-03 19:54:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 520 transitions. [2019-09-03 19:54:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-09-03 19:54:58,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:58,401 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:58,401 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:58,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash 511524763, now seen corresponding path program 51 times [2019-09-03 19:54:58,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:58,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:58,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12550 backedges. 2650 proven. 5000 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 19:54:59,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:59,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:54:59,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:00,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-09-03 19:55:00,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:00,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 19:55:00,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12550 backedges. 5100 proven. 2550 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 19:55:05,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:05,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 104] total 157 [2019-09-03 19:55:05,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-03 19:55:05,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-03 19:55:05,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4136, Invalid=20356, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 19:55:05,613 INFO L87 Difference]: Start difference. First operand 516 states and 520 transitions. Second operand 157 states. [2019-09-03 19:55:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:13,490 INFO L93 Difference]: Finished difference Result 942 states and 1100 transitions. [2019-09-03 19:55:13,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2019-09-03 19:55:13,490 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 517 [2019-09-03 19:55:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:13,495 INFO L225 Difference]: With dead ends: 942 [2019-09-03 19:55:13,495 INFO L226 Difference]: Without dead ends: 731 [2019-09-03 19:55:13,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31678 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=16325, Invalid=79465, Unknown=0, NotChecked=0, Total=95790 [2019-09-03 19:55:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-03 19:55:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 526. [2019-09-03 19:55:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-09-03 19:55:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 530 transitions. [2019-09-03 19:55:13,526 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 530 transitions. Word has length 517 [2019-09-03 19:55:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:13,526 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 530 transitions. [2019-09-03 19:55:13,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-03 19:55:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 530 transitions. [2019-09-03 19:55:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-09-03 19:55:13,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:13,529 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:13,529 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash 672198449, now seen corresponding path program 52 times [2019-09-03 19:55:13,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:13,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:13,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 13056 backedges. 2754 proven. 5202 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 19:55:15,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:15,026 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-03 19:55:15,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:15,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:15,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:15,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 19:55:15,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 13056 backedges. 5304 proven. 2652 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 19:55:20,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:20,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 106] total 160 [2019-09-03 19:55:20,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-09-03 19:55:20,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-09-03 19:55:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=21145, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 19:55:20,942 INFO L87 Difference]: Start difference. First operand 526 states and 530 transitions. Second operand 160 states. [2019-09-03 19:55:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:29,192 INFO L93 Difference]: Finished difference Result 960 states and 1121 transitions. [2019-09-03 19:55:29,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2019-09-03 19:55:29,192 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 527 [2019-09-03 19:55:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:29,195 INFO L225 Difference]: With dead ends: 960 [2019-09-03 19:55:29,196 INFO L226 Difference]: Without dead ends: 745 [2019-09-03 19:55:29,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32949 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16957, Invalid=82583, Unknown=0, NotChecked=0, Total=99540 [2019-09-03 19:55:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-09-03 19:55:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 536. [2019-09-03 19:55:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-09-03 19:55:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 540 transitions. [2019-09-03 19:55:29,223 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 540 transitions. Word has length 527 [2019-09-03 19:55:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:29,223 INFO L475 AbstractCegarLoop]: Abstraction has 536 states and 540 transitions. [2019-09-03 19:55:29,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-09-03 19:55:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 540 transitions. [2019-09-03 19:55:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-09-03 19:55:29,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:29,228 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:29,228 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1228390777, now seen corresponding path program 53 times [2019-09-03 19:55:29,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:29,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:29,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:29,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:29,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 2860 proven. 5408 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 19:55:30,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:30,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 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-03 19:55:30,639 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:30,940 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-09-03 19:55:30,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:30,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 19:55:30,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 5512 proven. 2756 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 19:55:36,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:36,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 108] total 163 [2019-09-03 19:55:36,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-03 19:55:36,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-03 19:55:36,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4457, Invalid=21949, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 19:55:36,850 INFO L87 Difference]: Start difference. First operand 536 states and 540 transitions. Second operand 163 states. [2019-09-03 19:55:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:45,567 INFO L93 Difference]: Finished difference Result 978 states and 1142 transitions. [2019-09-03 19:55:45,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2019-09-03 19:55:45,568 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 537 [2019-09-03 19:55:45,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:45,571 INFO L225 Difference]: With dead ends: 978 [2019-09-03 19:55:45,571 INFO L226 Difference]: Without dead ends: 759 [2019-09-03 19:55:45,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34245 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=17601, Invalid=85761, Unknown=0, NotChecked=0, Total=103362 [2019-09-03 19:55:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-09-03 19:55:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 546. [2019-09-03 19:55:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-03 19:55:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 550 transitions. [2019-09-03 19:55:45,601 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 550 transitions. Word has length 537 [2019-09-03 19:55:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:45,601 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 550 transitions. [2019-09-03 19:55:45,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-03 19:55:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 550 transitions. [2019-09-03 19:55:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-09-03 19:55:45,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:45,604 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:45,604 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:45,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash 339164573, now seen corresponding path program 54 times [2019-09-03 19:55:45,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:45,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:45,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:45,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:45,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14098 backedges. 2968 proven. 5618 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 19:55:47,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:47,093 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-03 19:55:47,105 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:47,411 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 54 check-sat command(s) [2019-09-03 19:55:47,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:47,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 19:55:47,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14098 backedges. 5724 proven. 2862 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 19:55:53,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:53,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 110] total 166 [2019-09-03 19:55:53,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-09-03 19:55:53,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-09-03 19:55:53,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4622, Invalid=22768, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 19:55:53,515 INFO L87 Difference]: Start difference. First operand 546 states and 550 transitions. Second operand 166 states. [2019-09-03 19:56:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:02,203 INFO L93 Difference]: Finished difference Result 996 states and 1163 transitions. [2019-09-03 19:56:02,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2019-09-03 19:56:02,204 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 547 [2019-09-03 19:56:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:02,208 INFO L225 Difference]: With dead ends: 996 [2019-09-03 19:56:02,208 INFO L226 Difference]: Without dead ends: 773 [2019-09-03 19:56:02,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35566 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=18257, Invalid=88999, Unknown=0, NotChecked=0, Total=107256 [2019-09-03 19:56:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-09-03 19:56:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 556. [2019-09-03 19:56:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-09-03 19:56:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 560 transitions. [2019-09-03 19:56:02,239 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 560 transitions. Word has length 547 [2019-09-03 19:56:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:02,239 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 560 transitions. [2019-09-03 19:56:02,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-09-03 19:56:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 560 transitions. [2019-09-03 19:56:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-09-03 19:56:02,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:02,242 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:02,242 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash -144835469, now seen corresponding path program 55 times [2019-09-03 19:56:02,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:02,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:02,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:02,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:02,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14634 backedges. 3078 proven. 5832 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 19:56:03,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:03,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:56:03,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:03,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 19:56:03,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14634 backedges. 5940 proven. 2970 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 19:56:10,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:10,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 112] total 169 [2019-09-03 19:56:10,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-03 19:56:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-03 19:56:10,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4790, Invalid=23602, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 19:56:10,283 INFO L87 Difference]: Start difference. First operand 556 states and 560 transitions. Second operand 169 states. [2019-09-03 19:56:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:19,426 INFO L93 Difference]: Finished difference Result 1014 states and 1184 transitions. [2019-09-03 19:56:19,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2019-09-03 19:56:19,427 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 557 [2019-09-03 19:56:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:19,431 INFO L225 Difference]: With dead ends: 1014 [2019-09-03 19:56:19,431 INFO L226 Difference]: Without dead ends: 787 [2019-09-03 19:56:19,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36912 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=18925, Invalid=92297, Unknown=0, NotChecked=0, Total=111222 [2019-09-03 19:56:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-03 19:56:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 566. [2019-09-03 19:56:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-03 19:56:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 570 transitions. [2019-09-03 19:56:19,462 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 570 transitions. Word has length 557 [2019-09-03 19:56:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:19,463 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 570 transitions. [2019-09-03 19:56:19,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-03 19:56:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 570 transitions. [2019-09-03 19:56:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-09-03 19:56:19,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:19,468 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:19,468 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1839762185, now seen corresponding path program 56 times [2019-09-03 19:56:19,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:19,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:19,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:19,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:19,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15180 backedges. 3190 proven. 6050 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 19:56:21,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:21,367 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-03 19:56:21,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:21,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:21,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:21,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 19:56:21,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15180 backedges. 6160 proven. 3080 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 19:56:28,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:28,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 114] total 172 [2019-09-03 19:56:28,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-09-03 19:56:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-09-03 19:56:28,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4961, Invalid=24451, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 19:56:28,038 INFO L87 Difference]: Start difference. First operand 566 states and 570 transitions. Second operand 172 states. [2019-09-03 19:56:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:37,618 INFO L93 Difference]: Finished difference Result 1032 states and 1205 transitions. [2019-09-03 19:56:37,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2019-09-03 19:56:37,618 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 567 [2019-09-03 19:56:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:37,621 INFO L225 Difference]: With dead ends: 1032 [2019-09-03 19:56:37,622 INFO L226 Difference]: Without dead ends: 801 [2019-09-03 19:56:37,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38283 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=19605, Invalid=95655, Unknown=0, NotChecked=0, Total=115260 [2019-09-03 19:56:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-09-03 19:56:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 576. [2019-09-03 19:56:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-03 19:56:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 580 transitions. [2019-09-03 19:56:37,652 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 580 transitions. Word has length 567 [2019-09-03 19:56:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:37,653 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 580 transitions. [2019-09-03 19:56:37,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-09-03 19:56:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 580 transitions. [2019-09-03 19:56:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-09-03 19:56:37,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:37,656 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:37,656 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:37,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:37,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2081490593, now seen corresponding path program 57 times [2019-09-03 19:56:37,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:37,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:37,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:37,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:37,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15736 backedges. 3304 proven. 6272 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 19:56:39,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:39,276 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-03 19:56:39,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:39,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-09-03 19:56:39,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:39,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 1555 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 19:56:39,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15736 backedges. 6384 proven. 3192 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 19:56:46,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:46,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 116] total 175 [2019-09-03 19:56:46,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 175 states [2019-09-03 19:56:46,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2019-09-03 19:56:46,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5135, Invalid=25315, Unknown=0, NotChecked=0, Total=30450 [2019-09-03 19:56:46,345 INFO L87 Difference]: Start difference. First operand 576 states and 580 transitions. Second operand 175 states. [2019-09-03 19:56:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:55,758 INFO L93 Difference]: Finished difference Result 1050 states and 1226 transitions. [2019-09-03 19:56:55,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2019-09-03 19:56:55,758 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 577 [2019-09-03 19:56:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:55,763 INFO L225 Difference]: With dead ends: 1050 [2019-09-03 19:56:55,763 INFO L226 Difference]: Without dead ends: 815 [2019-09-03 19:56:55,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39679 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=20297, Invalid=99073, Unknown=0, NotChecked=0, Total=119370 [2019-09-03 19:56:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-09-03 19:56:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 586. [2019-09-03 19:56:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-03 19:56:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 590 transitions. [2019-09-03 19:56:55,803 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 590 transitions. Word has length 577 [2019-09-03 19:56:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:55,803 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 590 transitions. [2019-09-03 19:56:55,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 175 states. [2019-09-03 19:56:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 590 transitions. [2019-09-03 19:56:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-09-03 19:56:55,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:55,808 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:55,808 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:55,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1351264395, now seen corresponding path program 58 times [2019-09-03 19:56:55,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:55,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:55,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 16302 backedges. 3420 proven. 6498 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 19:56:57,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:57,662 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-03 19:56:57,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:57,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:57,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:57,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 1582 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 19:56:57,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16302 backedges. 6612 proven. 3306 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 19:57:04,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:04,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 118] total 178 [2019-09-03 19:57:04,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-09-03 19:57:04,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-09-03 19:57:04,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5312, Invalid=26194, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 19:57:04,895 INFO L87 Difference]: Start difference. First operand 586 states and 590 transitions. Second operand 178 states. [2019-09-03 19:57:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:14,600 INFO L93 Difference]: Finished difference Result 1068 states and 1247 transitions. [2019-09-03 19:57:14,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2019-09-03 19:57:14,601 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 587 [2019-09-03 19:57:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:14,606 INFO L225 Difference]: With dead ends: 1068 [2019-09-03 19:57:14,606 INFO L226 Difference]: Without dead ends: 829 [2019-09-03 19:57:14,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 937 GetRequests, 587 SyntacticMatches, 0 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41100 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=21001, Invalid=102551, Unknown=0, NotChecked=0, Total=123552 [2019-09-03 19:57:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-03 19:57:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 596. [2019-09-03 19:57:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-03 19:57:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 600 transitions. [2019-09-03 19:57:14,641 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 600 transitions. Word has length 587 [2019-09-03 19:57:14,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:14,641 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 600 transitions. [2019-09-03 19:57:14,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-09-03 19:57:14,641 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 600 transitions. [2019-09-03 19:57:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-09-03 19:57:14,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:14,646 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:14,646 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:14,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash -152324789, now seen corresponding path program 59 times [2019-09-03 19:57:14,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:14,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:14,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16878 backedges. 3538 proven. 6728 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 19:57:16,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:16,371 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-03 19:57:16,382 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:16,742 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2019-09-03 19:57:16,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:16,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 19:57:16,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16878 backedges. 6844 proven. 3422 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 19:57:24,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:24,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 120] total 181 [2019-09-03 19:57:24,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 181 states [2019-09-03 19:57:24,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2019-09-03 19:57:24,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5492, Invalid=27088, Unknown=0, NotChecked=0, Total=32580 [2019-09-03 19:57:24,052 INFO L87 Difference]: Start difference. First operand 596 states and 600 transitions. Second operand 181 states. [2019-09-03 19:57:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:34,275 INFO L93 Difference]: Finished difference Result 1086 states and 1268 transitions. [2019-09-03 19:57:34,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2019-09-03 19:57:34,276 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 597 [2019-09-03 19:57:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:34,280 INFO L225 Difference]: With dead ends: 1086 [2019-09-03 19:57:34,280 INFO L226 Difference]: Without dead ends: 843 [2019-09-03 19:57:34,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 953 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42546 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=21717, Invalid=106089, Unknown=0, NotChecked=0, Total=127806 [2019-09-03 19:57:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-09-03 19:57:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 606. [2019-09-03 19:57:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-09-03 19:57:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 610 transitions. [2019-09-03 19:57:34,322 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 610 transitions. Word has length 597 [2019-09-03 19:57:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:34,323 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 610 transitions. [2019-09-03 19:57:34,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 181 states. [2019-09-03 19:57:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 610 transitions. [2019-09-03 19:57:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2019-09-03 19:57:34,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:34,326 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:34,326 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:34,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:34,327 INFO L82 PathProgramCache]: Analyzing trace with hash -613539103, now seen corresponding path program 60 times [2019-09-03 19:57:34,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:34,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:34,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:34,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:34,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17464 backedges. 3658 proven. 6962 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 19:57:36,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:36,178 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-03 19:57:36,188 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:36,554 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 60 check-sat command(s) [2019-09-03 19:57:36,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:36,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 19:57:36,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 17464 backedges. 7080 proven. 3540 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 19:57:44,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:44,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 122] total 184 [2019-09-03 19:57:44,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-09-03 19:57:44,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-09-03 19:57:44,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5675, Invalid=27997, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 19:57:44,027 INFO L87 Difference]: Start difference. First operand 606 states and 610 transitions. Second operand 184 states. [2019-09-03 19:57:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:53,732 INFO L93 Difference]: Finished difference Result 1104 states and 1289 transitions. [2019-09-03 19:57:53,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-09-03 19:57:53,733 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 607 [2019-09-03 19:57:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:53,736 INFO L225 Difference]: With dead ends: 1104 [2019-09-03 19:57:53,736 INFO L226 Difference]: Without dead ends: 857 [2019-09-03 19:57:53,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 969 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44017 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=22445, Invalid=109687, Unknown=0, NotChecked=0, Total=132132 [2019-09-03 19:57:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-09-03 19:57:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 616. [2019-09-03 19:57:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-03 19:57:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 620 transitions. [2019-09-03 19:57:53,774 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 620 transitions. Word has length 607 [2019-09-03 19:57:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:53,774 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 620 transitions. [2019-09-03 19:57:53,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-09-03 19:57:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 620 transitions. [2019-09-03 19:57:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2019-09-03 19:57:53,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:53,778 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:53,778 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:53,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:53,779 INFO L82 PathProgramCache]: Analyzing trace with hash 25473079, now seen corresponding path program 61 times [2019-09-03 19:57:53,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:53,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:53,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:53,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:53,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18060 backedges. 3780 proven. 7200 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 19:57:55,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:55,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:57:55,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:55,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 19:57:55,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18060 backedges. 7320 proven. 3660 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 19:58:03,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:03,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 124] total 187 [2019-09-03 19:58:03,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 187 states [2019-09-03 19:58:03,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2019-09-03 19:58:03,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5861, Invalid=28921, Unknown=0, NotChecked=0, Total=34782 [2019-09-03 19:58:03,763 INFO L87 Difference]: Start difference. First operand 616 states and 620 transitions. Second operand 187 states. [2019-09-03 19:58:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:14,843 INFO L93 Difference]: Finished difference Result 1122 states and 1310 transitions. [2019-09-03 19:58:14,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2019-09-03 19:58:14,844 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 617 [2019-09-03 19:58:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:14,848 INFO L225 Difference]: With dead ends: 1122 [2019-09-03 19:58:14,848 INFO L226 Difference]: Without dead ends: 871 [2019-09-03 19:58:14,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45513 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=23185, Invalid=113345, Unknown=0, NotChecked=0, Total=136530 [2019-09-03 19:58:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-09-03 19:58:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 626. [2019-09-03 19:58:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-03 19:58:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 630 transitions. [2019-09-03 19:58:14,898 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 630 transitions. Word has length 617 [2019-09-03 19:58:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:14,898 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 630 transitions. [2019-09-03 19:58:14,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 187 states. [2019-09-03 19:58:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 630 transitions. [2019-09-03 19:58:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2019-09-03 19:58:14,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:14,905 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:14,906 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:14,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:14,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1708954291, now seen corresponding path program 62 times [2019-09-03 19:58:14,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:14,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:14,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:14,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:14,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18666 backedges. 3904 proven. 7442 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 19:58:16,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:16,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 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-03 19:58:16,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:17,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:17,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:17,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 19:58:17,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 18666 backedges. 7564 proven. 3782 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 19:58:24,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:24,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 126] total 190 [2019-09-03 19:58:24,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-09-03 19:58:24,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-09-03 19:58:24,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6050, Invalid=29860, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 19:58:24,901 INFO L87 Difference]: Start difference. First operand 626 states and 630 transitions. Second operand 190 states. [2019-09-03 19:58:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:35,210 INFO L93 Difference]: Finished difference Result 1140 states and 1331 transitions. [2019-09-03 19:58:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 252 states. [2019-09-03 19:58:35,211 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 627 [2019-09-03 19:58:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:35,215 INFO L225 Difference]: With dead ends: 1140 [2019-09-03 19:58:35,215 INFO L226 Difference]: Without dead ends: 885 [2019-09-03 19:58:35,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1001 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47034 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=23937, Invalid=117063, Unknown=0, NotChecked=0, Total=141000 [2019-09-03 19:58:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-09-03 19:58:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 636. [2019-09-03 19:58:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-03 19:58:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 640 transitions. [2019-09-03 19:58:35,257 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 640 transitions. Word has length 627 [2019-09-03 19:58:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:35,257 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 640 transitions. [2019-09-03 19:58:35,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-09-03 19:58:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 640 transitions. [2019-09-03 19:58:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2019-09-03 19:58:35,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:35,261 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:35,261 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1951765981, now seen corresponding path program 63 times [2019-09-03 19:58:35,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:35,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:35,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:35,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:35,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 19282 backedges. 4030 proven. 7688 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 19:58:37,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:37,326 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-03 19:58:37,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:37,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-09-03 19:58:37,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:37,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1717 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 19:58:37,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 19282 backedges. 7812 proven. 3906 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 19:58:45,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:45,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 128] total 193 [2019-09-03 19:58:45,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 193 states [2019-09-03 19:58:45,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2019-09-03 19:58:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6242, Invalid=30814, Unknown=0, NotChecked=0, Total=37056 [2019-09-03 19:58:45,933 INFO L87 Difference]: Start difference. First operand 636 states and 640 transitions. Second operand 193 states. [2019-09-03 19:58:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:57,160 INFO L93 Difference]: Finished difference Result 1158 states and 1352 transitions. [2019-09-03 19:58:57,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2019-09-03 19:58:57,160 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 637 [2019-09-03 19:58:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:57,166 INFO L225 Difference]: With dead ends: 1158 [2019-09-03 19:58:57,166 INFO L226 Difference]: Without dead ends: 899 [2019-09-03 19:58:57,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48580 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=24701, Invalid=120841, Unknown=0, NotChecked=0, Total=145542 [2019-09-03 19:58:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-03 19:58:57,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 646. [2019-09-03 19:58:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-03 19:58:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 650 transitions. [2019-09-03 19:58:57,209 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 650 transitions. Word has length 637 [2019-09-03 19:58:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:57,209 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 650 transitions. [2019-09-03 19:58:57,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 193 states. [2019-09-03 19:58:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 650 transitions. [2019-09-03 19:58:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-09-03 19:58:57,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:57,214 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:57,215 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1525003961, now seen corresponding path program 64 times [2019-09-03 19:58:57,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:57,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:57,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19908 backedges. 4158 proven. 7938 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 19:58:59,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:59,329 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-03 19:58:59,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:59,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:59,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:59,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1744 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 19:58:59,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19908 backedges. 8064 proven. 4032 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 19:59:07,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:07,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 130] total 196 [2019-09-03 19:59:07,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-09-03 19:59:07,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-09-03 19:59:07,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6437, Invalid=31783, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 19:59:07,969 INFO L87 Difference]: Start difference. First operand 646 states and 650 transitions. Second operand 196 states. [2019-09-03 19:59:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:21,311 INFO L93 Difference]: Finished difference Result 1176 states and 1373 transitions. [2019-09-03 19:59:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2019-09-03 19:59:21,311 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 647 [2019-09-03 19:59:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:21,316 INFO L225 Difference]: With dead ends: 1176 [2019-09-03 19:59:21,317 INFO L226 Difference]: Without dead ends: 913 [2019-09-03 19:59:21,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50151 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=25477, Invalid=124679, Unknown=0, NotChecked=0, Total=150156 [2019-09-03 19:59:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-03 19:59:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 656. [2019-09-03 19:59:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-09-03 19:59:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 660 transitions. [2019-09-03 19:59:21,378 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 660 transitions. Word has length 647 [2019-09-03 19:59:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:21,378 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 660 transitions. [2019-09-03 19:59:21,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-09-03 19:59:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 660 transitions. [2019-09-03 19:59:21,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2019-09-03 19:59:21,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:21,384 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:21,384 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:21,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:21,385 INFO L82 PathProgramCache]: Analyzing trace with hash -737320177, now seen corresponding path program 65 times [2019-09-03 19:59:21,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:21,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:21,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:21,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 20544 backedges. 4288 proven. 8192 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 19:59:23,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:23,939 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-03 19:59:23,949 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:24,358 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2019-09-03 19:59:24,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:24,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1771 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 19:59:24,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 20544 backedges. 8320 proven. 4160 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 19:59:33,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:33,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 132] total 199 [2019-09-03 19:59:33,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 199 states [2019-09-03 19:59:33,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2019-09-03 19:59:33,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6635, Invalid=32767, Unknown=0, NotChecked=0, Total=39402 [2019-09-03 19:59:33,137 INFO L87 Difference]: Start difference. First operand 656 states and 660 transitions. Second operand 199 states. [2019-09-03 19:59:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:47,304 INFO L93 Difference]: Finished difference Result 1194 states and 1394 transitions. [2019-09-03 19:59:47,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2019-09-03 19:59:47,305 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 657 [2019-09-03 19:59:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:47,309 INFO L225 Difference]: With dead ends: 1194 [2019-09-03 19:59:47,309 INFO L226 Difference]: Without dead ends: 927 [2019-09-03 19:59:47,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1049 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51747 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=26265, Invalid=128577, Unknown=0, NotChecked=0, Total=154842 [2019-09-03 19:59:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-03 19:59:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 666. [2019-09-03 19:59:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-03 19:59:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 670 transitions. [2019-09-03 19:59:47,353 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 670 transitions. Word has length 657 [2019-09-03 19:59:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:47,353 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 670 transitions. [2019-09-03 19:59:47,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 199 states. [2019-09-03 19:59:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 670 transitions. [2019-09-03 19:59:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-09-03 19:59:47,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:47,357 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:47,357 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:47,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:47,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1942322981, now seen corresponding path program 66 times [2019-09-03 19:59:47,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:47,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:47,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 21190 backedges. 4420 proven. 8450 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-03 19:59:49,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:49,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:59:49,578 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:49,995 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 66 check-sat command(s) [2019-09-03 19:59:49,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:50,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 1798 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-03 19:59:50,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21190 backedges. 8580 proven. 4290 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-03 19:59:58,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:58,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 134] total 202 [2019-09-03 19:59:58,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-09-03 19:59:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-09-03 19:59:58,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6836, Invalid=33766, Unknown=0, NotChecked=0, Total=40602 [2019-09-03 19:59:58,918 INFO L87 Difference]: Start difference. First operand 666 states and 670 transitions. Second operand 202 states. [2019-09-03 20:00:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:15,522 INFO L93 Difference]: Finished difference Result 1212 states and 1415 transitions. [2019-09-03 20:00:15,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2019-09-03 20:00:15,523 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 667 [2019-09-03 20:00:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:15,526 INFO L225 Difference]: With dead ends: 1212 [2019-09-03 20:00:15,527 INFO L226 Difference]: Without dead ends: 941 [2019-09-03 20:00:15,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1065 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53368 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=27065, Invalid=132535, Unknown=0, NotChecked=0, Total=159600 [2019-09-03 20:00:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-09-03 20:00:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 676. [2019-09-03 20:00:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-09-03 20:00:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 680 transitions. [2019-09-03 20:00:15,574 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 680 transitions. Word has length 667 [2019-09-03 20:00:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:15,574 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 680 transitions. [2019-09-03 20:00:15,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-09-03 20:00:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 680 transitions. [2019-09-03 20:00:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-09-03 20:00:15,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:15,578 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:15,578 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:15,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1877075205, now seen corresponding path program 67 times [2019-09-03 20:00:15,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:15,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:15,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:15,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:15,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 21846 backedges. 4554 proven. 8712 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-03 20:00:17,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:17,926 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-03 20:00:17,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:18,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 1825 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-03 20:00:18,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 21846 backedges. 8844 proven. 4422 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-03 20:00:27,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:27,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 136] total 205 [2019-09-03 20:00:27,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 205 states [2019-09-03 20:00:27,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2019-09-03 20:00:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7040, Invalid=34780, Unknown=0, NotChecked=0, Total=41820 [2019-09-03 20:00:27,384 INFO L87 Difference]: Start difference. First operand 676 states and 680 transitions. Second operand 205 states. [2019-09-03 20:00:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:40,369 INFO L93 Difference]: Finished difference Result 1230 states and 1436 transitions. [2019-09-03 20:00:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 272 states. [2019-09-03 20:00:40,369 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 677 [2019-09-03 20:00:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:40,373 INFO L225 Difference]: With dead ends: 1230 [2019-09-03 20:00:40,373 INFO L226 Difference]: Without dead ends: 955 [2019-09-03 20:00:40,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55014 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=27877, Invalid=136553, Unknown=0, NotChecked=0, Total=164430 [2019-09-03 20:00:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-03 20:00:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 686. [2019-09-03 20:00:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-09-03 20:00:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 690 transitions. [2019-09-03 20:00:40,417 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 690 transitions. Word has length 677 [2019-09-03 20:00:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:40,417 INFO L475 AbstractCegarLoop]: Abstraction has 686 states and 690 transitions. [2019-09-03 20:00:40,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 205 states. [2019-09-03 20:00:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 690 transitions. [2019-09-03 20:00:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-09-03 20:00:40,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:40,421 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:40,422 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:40,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1100170897, now seen corresponding path program 68 times [2019-09-03 20:00:40,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:40,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:40,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:40,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:40,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 22512 backedges. 4690 proven. 8978 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-03 20:00:42,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:42,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:00:42,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:42,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:42,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:42,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1852 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-03 20:00:42,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 22512 backedges. 9112 proven. 4556 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-03 20:00:52,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:52,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 138] total 208 [2019-09-03 20:00:52,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 208 states [2019-09-03 20:00:52,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2019-09-03 20:00:52,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7247, Invalid=35809, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 20:00:52,526 INFO L87 Difference]: Start difference. First operand 686 states and 690 transitions. Second operand 208 states. [2019-09-03 20:01:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:08,351 INFO L93 Difference]: Finished difference Result 1248 states and 1457 transitions. [2019-09-03 20:01:08,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 276 states. [2019-09-03 20:01:08,352 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 687 [2019-09-03 20:01:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:08,355 INFO L225 Difference]: With dead ends: 1248 [2019-09-03 20:01:08,355 INFO L226 Difference]: Without dead ends: 969 [2019-09-03 20:01:08,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1097 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56685 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=28701, Invalid=140631, Unknown=0, NotChecked=0, Total=169332 [2019-09-03 20:01:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-09-03 20:01:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 696. [2019-09-03 20:01:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-03 20:01:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 700 transitions. [2019-09-03 20:01:08,398 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 700 transitions. Word has length 687 [2019-09-03 20:01:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:08,398 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 700 transitions. [2019-09-03 20:01:08,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 208 states. [2019-09-03 20:01:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 700 transitions. [2019-09-03 20:01:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-09-03 20:01:08,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:08,402 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:08,403 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash 202183143, now seen corresponding path program 69 times [2019-09-03 20:01:08,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:08,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:08,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:08,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:08,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 23188 backedges. 4828 proven. 9248 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-03 20:01:10,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:10,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:01:10,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:01:11,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-09-03 20:01:11,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:11,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1879 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-03 20:01:11,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23188 backedges. 9384 proven. 4692 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-03 20:01:21,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:21,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 140] total 211 [2019-09-03 20:01:21,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 211 states [2019-09-03 20:01:21,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2019-09-03 20:01:21,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7457, Invalid=36853, Unknown=0, NotChecked=0, Total=44310 [2019-09-03 20:01:21,007 INFO L87 Difference]: Start difference. First operand 696 states and 700 transitions. Second operand 211 states. [2019-09-03 20:01:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:34,828 INFO L93 Difference]: Finished difference Result 1266 states and 1478 transitions. [2019-09-03 20:01:34,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 280 states. [2019-09-03 20:01:34,829 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 697 [2019-09-03 20:01:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:34,831 INFO L225 Difference]: With dead ends: 1266 [2019-09-03 20:01:34,831 INFO L226 Difference]: Without dead ends: 983 [2019-09-03 20:01:34,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58381 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=29537, Invalid=144769, Unknown=0, NotChecked=0, Total=174306 [2019-09-03 20:01:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-09-03 20:01:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 706. [2019-09-03 20:01:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-03 20:01:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 710 transitions. [2019-09-03 20:01:34,872 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 710 transitions. Word has length 697 [2019-09-03 20:01:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:34,873 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 710 transitions. [2019-09-03 20:01:34,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 211 states. [2019-09-03 20:01:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 710 transitions. [2019-09-03 20:01:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2019-09-03 20:01:34,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:34,877 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:34,877 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:34,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:34,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832957, now seen corresponding path program 70 times [2019-09-03 20:01:34,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:34,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:34,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:34,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:34,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 23874 backedges. 4968 proven. 9522 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-03 20:01:37,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:37,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:01:37,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:01:37,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:01:37,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:37,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-03 20:01:37,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 23874 backedges. 9660 proven. 4830 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-03 20:01:47,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:47,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 142] total 214 [2019-09-03 20:01:47,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 214 states [2019-09-03 20:01:47,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2019-09-03 20:01:47,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7670, Invalid=37912, Unknown=0, NotChecked=0, Total=45582 [2019-09-03 20:01:47,534 INFO L87 Difference]: Start difference. First operand 706 states and 710 transitions. Second operand 214 states. [2019-09-03 20:02:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:02,064 INFO L93 Difference]: Finished difference Result 1284 states and 1499 transitions. [2019-09-03 20:02:02,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 284 states. [2019-09-03 20:02:02,064 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 707 [2019-09-03 20:02:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:02,067 INFO L225 Difference]: With dead ends: 1284 [2019-09-03 20:02:02,067 INFO L226 Difference]: Without dead ends: 997 [2019-09-03 20:02:02,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1129 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60102 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=30385, Invalid=148967, Unknown=0, NotChecked=0, Total=179352 [2019-09-03 20:02:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-09-03 20:02:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 716. [2019-09-03 20:02:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-03 20:02:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 720 transitions. [2019-09-03 20:02:02,109 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 720 transitions. Word has length 707 [2019-09-03 20:02:02,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:02,110 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 720 transitions. [2019-09-03 20:02:02,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 214 states. [2019-09-03 20:02:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 720 transitions. [2019-09-03 20:02:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-09-03 20:02:02,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:02,114 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:02,114 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1254803411, now seen corresponding path program 71 times [2019-09-03 20:02:02,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:02,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:02,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:02,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:02,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 24570 backedges. 5110 proven. 9800 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-03 20:02:04,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:04,683 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-03 20:02:04,693 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:02:05,190 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 71 check-sat command(s) [2019-09-03 20:02:05,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:05,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 1933 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-03 20:02:05,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 24570 backedges. 9940 proven. 4970 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-03 20:02:15,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:15,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 144] total 217 [2019-09-03 20:02:15,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 217 states [2019-09-03 20:02:15,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2019-09-03 20:02:15,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7886, Invalid=38986, Unknown=0, NotChecked=0, Total=46872 [2019-09-03 20:02:15,513 INFO L87 Difference]: Start difference. First operand 716 states and 720 transitions. Second operand 217 states.