java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_3-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:35:50,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:35:50,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:35:50,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:35:50,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:35:50,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:35:50,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:35:50,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:35:50,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:35:50,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:35:50,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:35:50,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:35:50,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:35:50,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:35:50,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:35:50,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:35:50,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:35:50,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:35:50,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:35:50,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:35:50,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:35:50,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:35:50,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:35:50,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:35:50,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:35:50,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:35:50,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:35:50,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:35:50,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:35:50,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:35:50,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:35:50,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:35:50,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:35:50,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:35:50,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:35:50,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:35:50,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:35:50,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:35:50,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:35:50,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:35:50,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:35:50,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:35:50,442 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:35:50,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:35:50,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:35:50,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:35:50,445 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:35:50,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:35:50,446 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:35:50,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:35:50,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:35:50,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:35:50,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:35:50,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:35:50,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:35:50,448 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:35:50,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:35:50,448 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:35:50,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:35:50,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:35:50,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:35:50,450 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:35:50,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:35:50,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:35:50,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:35:50,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:35:50,451 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:35:50,451 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:35:50,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:35:50,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:35:50,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:35:50,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:35:50,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:35:50,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:35:50,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:35:50,501 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:35:50,502 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-2.i [2019-09-08 02:35:50,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a17feb01/97d0d20da50b4fa08206274c8236d03f/FLAG046fa7c09 [2019-09-08 02:35:51,052 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:35:51,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-2.i [2019-09-08 02:35:51,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a17feb01/97d0d20da50b4fa08206274c8236d03f/FLAG046fa7c09 [2019-09-08 02:35:51,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a17feb01/97d0d20da50b4fa08206274c8236d03f [2019-09-08 02:35:51,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:35:51,494 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:35:51,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:35:51,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:35:51,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:35:51,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:35:51" (1/1) ... [2019-09-08 02:35:51,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5748c03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51, skipping insertion in model container [2019-09-08 02:35:51,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:35:51" (1/1) ... [2019-09-08 02:35:51,510 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:35:51,528 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:35:51,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:35:51,708 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:35:51,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:35:51,745 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:35:51,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51 WrapperNode [2019-09-08 02:35:51,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:35:51,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:35:51,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:35:51,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:35:51,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51" (1/1) ... [2019-09-08 02:35:51,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51" (1/1) ... [2019-09-08 02:35:51,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51" (1/1) ... [2019-09-08 02:35:51,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51" (1/1) ... [2019-09-08 02:35:51,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51" (1/1) ... [2019-09-08 02:35:51,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51" (1/1) ... [2019-09-08 02:35:51,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51" (1/1) ... [2019-09-08 02:35:51,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:35:51,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:35:51,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:35:51,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:35:51,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:35:51,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:35:51,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:35:51,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:35:51,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:35:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:35:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:35:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:35:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:35:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 02:35:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:35:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:35:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:35:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:35:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:35:52,145 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:35:52,145 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 02:35:52,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:35:52 BoogieIcfgContainer [2019-09-08 02:35:52,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:35:52,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:35:52,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:35:52,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:35:52,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:35:51" (1/3) ... [2019-09-08 02:35:52,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4236c902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:35:52, skipping insertion in model container [2019-09-08 02:35:52,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:35:51" (2/3) ... [2019-09-08 02:35:52,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4236c902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:35:52, skipping insertion in model container [2019-09-08 02:35:52,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:35:52" (3/3) ... [2019-09-08 02:35:52,155 INFO L109 eAbstractionObserver]: Analyzing ICFG array_3-2.i [2019-09-08 02:35:52,165 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:35:52,182 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:35:52,225 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:35:52,265 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:35:52,266 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:35:52,266 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:35:52,266 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:35:52,267 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:35:52,267 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:35:52,267 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:35:52,267 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:35:52,267 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:35:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-08 02:35:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 02:35:52,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:52,299 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:52,301 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:52,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1584649929, now seen corresponding path program 1 times [2019-09-08 02:35:52,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:52,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:52,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:52,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:52,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:35:52,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:35:52,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:35:52,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:35:52,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:35:52,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:35:52,447 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-08 02:35:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:52,473 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-08 02:35:52,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:35:52,475 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-08 02:35:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:52,484 INFO L225 Difference]: With dead ends: 42 [2019-09-08 02:35:52,484 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 02:35:52,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:35:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 02:35:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-08 02:35:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 02:35:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-08 02:35:52,529 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-09-08 02:35:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:52,530 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-08 02:35:52,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:35:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-08 02:35:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:35:52,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:52,531 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:52,532 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:52,532 INFO L82 PathProgramCache]: Analyzing trace with hash -963606854, now seen corresponding path program 1 times [2019-09-08 02:35:52,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:52,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:52,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:52,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:52,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:35:52,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:35:52,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:35:52,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:35:52,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:35:52,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:35:52,609 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-09-08 02:35:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:52,666 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-09-08 02:35:52,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:35:52,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-08 02:35:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:52,669 INFO L225 Difference]: With dead ends: 35 [2019-09-08 02:35:52,669 INFO L226 Difference]: Without dead ends: 25 [2019-09-08 02:35:52,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:35:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-08 02:35:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-09-08 02:35:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 02:35:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-08 02:35:52,677 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-09-08 02:35:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:52,677 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-08 02:35:52,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:35:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-08 02:35:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:35:52,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:52,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:52,679 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:52,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:52,679 INFO L82 PathProgramCache]: Analyzing trace with hash -544788776, now seen corresponding path program 1 times [2019-09-08 02:35:52,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:52,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:52,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:52,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:35:52,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:35:52,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:35:52,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:35:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:35:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:35:52,802 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 5 states. [2019-09-08 02:35:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:52,884 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-09-08 02:35:52,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:35:52,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-08 02:35:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:52,886 INFO L225 Difference]: With dead ends: 29 [2019-09-08 02:35:52,886 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 02:35:52,886 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-08 02:35:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 02:35:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-09-08 02:35:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 02:35:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-08 02:35:52,892 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2019-09-08 02:35:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:52,892 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-08 02:35:52,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:35:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-08 02:35:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:35:52,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:52,897 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:52,898 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:52,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:52,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1315898579, now seen corresponding path program 1 times [2019-09-08 02:35:52,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:52,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:52,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:52,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:52,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:35:52,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:52,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:52,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:53,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 02:35:53,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:35:53,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:53,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 02:35:53,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:35:53,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:35:53,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:35:53,065 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2019-09-08 02:35:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:53,119 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-09-08 02:35:53,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:35:53,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-08 02:35:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:53,121 INFO L225 Difference]: With dead ends: 44 [2019-09-08 02:35:53,121 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 02:35:53,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:35:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 02:35:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-09-08 02:35:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 02:35:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-09-08 02:35:53,127 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 21 [2019-09-08 02:35:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:53,127 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-09-08 02:35:53,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:35:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-09-08 02:35:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 02:35:53,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:53,129 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:53,129 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:53,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1597858191, now seen corresponding path program 2 times [2019-09-08 02:35:53,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:53,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:53,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:35:53,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:53,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:53,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:35:53,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:35:53,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:53,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 02:35:53,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:35:53,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:53,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 02:35:53,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:35:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:35:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:35:53,290 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2019-09-08 02:35:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:53,357 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-09-08 02:35:53,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:35:53,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-08 02:35:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:53,359 INFO L225 Difference]: With dead ends: 51 [2019-09-08 02:35:53,359 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 02:35:53,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:35:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 02:35:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-09-08 02:35:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:35:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-08 02:35:53,365 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2019-09-08 02:35:53,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:53,366 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-08 02:35:53,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:35:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-08 02:35:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 02:35:53,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:53,367 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:53,367 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:53,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:53,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1399437169, now seen corresponding path program 3 times [2019-09-08 02:35:53,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:53,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:53,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:53,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:53,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:35:53,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:53,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:53,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:35:53,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 02:35:53,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:53,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:35:53,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:53,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:35:53,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:53,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-08 02:35:53,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:35:53,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:35:53,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:35:53,533 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 9 states. [2019-09-08 02:35:53,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:53,639 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2019-09-08 02:35:53,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:35:53,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-09-08 02:35:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:53,640 INFO L225 Difference]: With dead ends: 60 [2019-09-08 02:35:53,641 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 02:35:53,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:35:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 02:35:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-08 02:35:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-08 02:35:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-09-08 02:35:53,656 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 25 [2019-09-08 02:35:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:53,657 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-09-08 02:35:53,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:35:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-09-08 02:35:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 02:35:53,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:53,660 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:53,661 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:53,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash 893709598, now seen corresponding path program 4 times [2019-09-08 02:35:53,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:53,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:53,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:53,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:53,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:53,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:35:53,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:35:53,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:53,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 02:35:53,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:53,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:53,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 02:35:53,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:35:53,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:35:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:35:53,861 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-09-08 02:35:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:53,946 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-09-08 02:35:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:35:53,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-09-08 02:35:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:53,947 INFO L225 Difference]: With dead ends: 74 [2019-09-08 02:35:53,948 INFO L226 Difference]: Without dead ends: 49 [2019-09-08 02:35:53,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:35:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-08 02:35:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-09-08 02:35:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 02:35:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-09-08 02:35:53,955 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2019-09-08 02:35:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:53,955 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-09-08 02:35:53,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:35:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-09-08 02:35:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 02:35:53,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:53,957 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:53,957 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2087492412, now seen corresponding path program 5 times [2019-09-08 02:35:53,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:53,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:53,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:53,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:54,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:54,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:35:54,086 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:54,129 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 02:35:54,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:54,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 02:35:54,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:54,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:54,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-08 02:35:54,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:35:54,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:35:54,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:35:54,159 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 9 states. [2019-09-08 02:35:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:54,229 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2019-09-08 02:35:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:35:54,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-09-08 02:35:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:54,230 INFO L225 Difference]: With dead ends: 81 [2019-09-08 02:35:54,230 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 02:35:54,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:35:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 02:35:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2019-09-08 02:35:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 02:35:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-09-08 02:35:54,246 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 41 [2019-09-08 02:35:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:54,246 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-09-08 02:35:54,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:35:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-09-08 02:35:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 02:35:54,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:54,250 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:54,250 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1738458662, now seen corresponding path program 6 times [2019-09-08 02:35:54,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:54,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:54,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:54,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:54,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:54,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:54,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:35:54,423 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:54,470 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 02:35:54,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:54,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 02:35:54,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:54,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:54,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 02:35:54,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:35:54,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:35:54,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:35:54,510 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 10 states. [2019-09-08 02:35:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:54,605 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2019-09-08 02:35:54,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:35:54,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-09-08 02:35:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:54,606 INFO L225 Difference]: With dead ends: 88 [2019-09-08 02:35:54,607 INFO L226 Difference]: Without dead ends: 63 [2019-09-08 02:35:54,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:35:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-08 02:35:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2019-09-08 02:35:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 02:35:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-09-08 02:35:54,614 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 43 [2019-09-08 02:35:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:54,615 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-09-08 02:35:54,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:35:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-09-08 02:35:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 02:35:54,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:54,616 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:54,616 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1985435400, now seen corresponding path program 7 times [2019-09-08 02:35:54,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:54,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:54,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:54,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:54,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:54,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:54,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:54,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:54,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 02:35:54,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:54,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:54,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 02:35:54,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:35:54,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:35:54,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:35:54,856 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 11 states. [2019-09-08 02:35:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:54,949 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2019-09-08 02:35:54,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:35:54,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-09-08 02:35:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:54,950 INFO L225 Difference]: With dead ends: 95 [2019-09-08 02:35:54,950 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 02:35:54,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:35:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 02:35:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2019-09-08 02:35:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 02:35:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-09-08 02:35:54,957 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 45 [2019-09-08 02:35:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:54,957 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-09-08 02:35:54,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:35:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-09-08 02:35:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 02:35:54,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:54,958 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:54,959 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1188087958, now seen corresponding path program 8 times [2019-09-08 02:35:54,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:54,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:54,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:55,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:55,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:55,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:35:55,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:35:55,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:55,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 02:35:55,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:55,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:55,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 02:35:55,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:35:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:35:55,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:35:55,138 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 12 states. [2019-09-08 02:35:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:55,269 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2019-09-08 02:35:55,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:35:55,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-09-08 02:35:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:55,273 INFO L225 Difference]: With dead ends: 102 [2019-09-08 02:35:55,273 INFO L226 Difference]: Without dead ends: 77 [2019-09-08 02:35:55,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:35:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-08 02:35:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 50. [2019-09-08 02:35:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-08 02:35:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-09-08 02:35:55,291 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 47 [2019-09-08 02:35:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:55,292 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-09-08 02:35:55,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:35:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-09-08 02:35:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 02:35:55,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:55,295 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:55,296 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:55,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1517254836, now seen corresponding path program 9 times [2019-09-08 02:35:55,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:55,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:55,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:55,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:55,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:35:55,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:55,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:55,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:35:55,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 02:35:55,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:55,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 02:35:55,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:55,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-08 02:35:55,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:55,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2019-09-08 02:35:55,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:35:55,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:35:55,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:35:55,578 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 15 states. [2019-09-08 02:35:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:55,707 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2019-09-08 02:35:55,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:35:55,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2019-09-08 02:35:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:55,711 INFO L225 Difference]: With dead ends: 111 [2019-09-08 02:35:55,712 INFO L226 Difference]: Without dead ends: 78 [2019-09-08 02:35:55,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:35:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-08 02:35:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-08 02:35:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-08 02:35:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-09-08 02:35:55,726 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 49 [2019-09-08 02:35:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:55,727 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-09-08 02:35:55,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:35:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-09-08 02:35:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 02:35:55,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:55,728 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:55,729 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:55,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1277783220, now seen corresponding path program 10 times [2019-09-08 02:35:55,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:55,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:55,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:55,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:55,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 02:35:55,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:55,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:55,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:35:55,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:35:55,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:55,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:35:55,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 02:35:56,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:56,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 02:35:56,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:35:56,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:35:56,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:35:56,019 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 14 states. [2019-09-08 02:35:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:56,106 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2019-09-08 02:35:56,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:35:56,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2019-09-08 02:35:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:56,107 INFO L225 Difference]: With dead ends: 134 [2019-09-08 02:35:56,107 INFO L226 Difference]: Without dead ends: 85 [2019-09-08 02:35:56,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:35:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-08 02:35:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2019-09-08 02:35:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-08 02:35:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2019-09-08 02:35:56,114 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 75 [2019-09-08 02:35:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:56,115 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2019-09-08 02:35:56,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:35:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2019-09-08 02:35:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 02:35:56,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:56,116 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:56,117 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1422072878, now seen corresponding path program 11 times [2019-09-08 02:35:56,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:56,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:56,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:56,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:56,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 02:35:56,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:56,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:35:56,283 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:56,384 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 02:35:56,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:56,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 02:35:56,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:35:56,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:56,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-08 02:35:56,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:35:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:35:56,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:35:56,430 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 15 states. [2019-09-08 02:35:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:56,544 INFO L93 Difference]: Finished difference Result 141 states and 169 transitions. [2019-09-08 02:35:56,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:35:56,545 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 77 [2019-09-08 02:35:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:56,546 INFO L225 Difference]: With dead ends: 141 [2019-09-08 02:35:56,546 INFO L226 Difference]: Without dead ends: 92 [2019-09-08 02:35:56,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:35:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-08 02:35:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2019-09-08 02:35:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-08 02:35:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2019-09-08 02:35:56,553 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 77 [2019-09-08 02:35:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:56,554 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2019-09-08 02:35:56,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:35:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2019-09-08 02:35:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 02:35:56,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:56,555 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:56,556 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:56,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1823536272, now seen corresponding path program 12 times [2019-09-08 02:35:56,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:56,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:56,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 02:35:56,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:56,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:35:56,738 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:56,888 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 02:35:56,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:56,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 02:35:56,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 02:35:56,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:56,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-08 02:35:56,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:35:56,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:35:56,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:35:56,923 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 16 states. [2019-09-08 02:35:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:57,041 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2019-09-08 02:35:57,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:35:57,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2019-09-08 02:35:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:57,043 INFO L225 Difference]: With dead ends: 148 [2019-09-08 02:35:57,043 INFO L226 Difference]: Without dead ends: 99 [2019-09-08 02:35:57,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:35:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-08 02:35:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2019-09-08 02:35:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-08 02:35:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-09-08 02:35:57,049 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 79 [2019-09-08 02:35:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:57,049 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-09-08 02:35:57,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:35:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-09-08 02:35:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 02:35:57,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:57,050 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:57,051 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:57,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:57,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1082801266, now seen corresponding path program 13 times [2019-09-08 02:35:57,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:57,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:57,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 02:35:57,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:57,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:57,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:57,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 02:35:57,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 02:35:57,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:57,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-08 02:35:57,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 02:35:57,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 02:35:57,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:35:57,285 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 17 states. [2019-09-08 02:35:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:57,412 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2019-09-08 02:35:57,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 02:35:57,414 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-09-08 02:35:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:57,415 INFO L225 Difference]: With dead ends: 155 [2019-09-08 02:35:57,416 INFO L226 Difference]: Without dead ends: 106 [2019-09-08 02:35:57,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:35:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-08 02:35:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2019-09-08 02:35:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-08 02:35:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-09-08 02:35:57,421 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 81 [2019-09-08 02:35:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:57,421 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-09-08 02:35:57,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 02:35:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-09-08 02:35:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 02:35:57,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:57,423 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:57,423 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:57,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2093935660, now seen corresponding path program 14 times [2019-09-08 02:35:57,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:57,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:57,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:57,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:57,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 02:35:57,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:57,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:57,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:35:57,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:35:57,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:57,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 02:35:57,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:35:57,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:57,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-08 02:35:57,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:35:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:35:57,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:35:57,694 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 18 states. [2019-09-08 02:35:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:57,850 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2019-09-08 02:35:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 02:35:57,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2019-09-08 02:35:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:57,852 INFO L225 Difference]: With dead ends: 162 [2019-09-08 02:35:57,852 INFO L226 Difference]: Without dead ends: 113 [2019-09-08 02:35:57,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:35:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-08 02:35:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 86. [2019-09-08 02:35:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-08 02:35:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-09-08 02:35:57,855 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 83 [2019-09-08 02:35:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:57,856 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-09-08 02:35:57,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:35:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-09-08 02:35:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 02:35:57,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:57,857 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:57,857 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:57,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1216374090, now seen corresponding path program 15 times [2019-09-08 02:35:57,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:57,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:57,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:57,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:57,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 02:35:58,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:58,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:58,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:35:58,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-08 02:35:58,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:58,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 02:35:58,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:58,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-08 02:35:58,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:58,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 21 [2019-09-08 02:35:58,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:35:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:35:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:35:58,219 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 21 states. [2019-09-08 02:35:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:58,420 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2019-09-08 02:35:58,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:35:58,420 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2019-09-08 02:35:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:58,421 INFO L225 Difference]: With dead ends: 171 [2019-09-08 02:35:58,421 INFO L226 Difference]: Without dead ends: 114 [2019-09-08 02:35:58,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=283, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:35:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-08 02:35:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-09-08 02:35:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-08 02:35:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2019-09-08 02:35:58,427 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 85 [2019-09-08 02:35:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:58,427 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2019-09-08 02:35:58,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:35:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2019-09-08 02:35:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 02:35:58,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:58,428 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:58,428 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1858273206, now seen corresponding path program 16 times [2019-09-08 02:35:58,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:58,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:58,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 02:35:58,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:58,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:58,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:35:58,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:35:58,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:58,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 02:35:58,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:35:58,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:58,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-08 02:35:58,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:35:58,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:35:58,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:35:58,746 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 20 states. [2019-09-08 02:35:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:58,885 INFO L93 Difference]: Finished difference Result 194 states and 232 transitions. [2019-09-08 02:35:58,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:35:58,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2019-09-08 02:35:58,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:58,887 INFO L225 Difference]: With dead ends: 194 [2019-09-08 02:35:58,887 INFO L226 Difference]: Without dead ends: 121 [2019-09-08 02:35:58,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:35:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-08 02:35:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-09-08 02:35:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-08 02:35:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2019-09-08 02:35:58,892 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 111 [2019-09-08 02:35:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:58,893 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2019-09-08 02:35:58,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:35:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2019-09-08 02:35:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 02:35:58,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:58,894 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:58,894 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1942732904, now seen corresponding path program 17 times [2019-09-08 02:35:58,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:58,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:58,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 02:35:59,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:59,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:59,180 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:35:59,646 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-08 02:35:59,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:59,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 02:35:59,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 02:35:59,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:59,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-08 02:35:59,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:35:59,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:35:59,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:35:59,685 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 21 states. [2019-09-08 02:35:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:59,842 INFO L93 Difference]: Finished difference Result 201 states and 241 transitions. [2019-09-08 02:35:59,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:35:59,842 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 113 [2019-09-08 02:35:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:59,843 INFO L225 Difference]: With dead ends: 201 [2019-09-08 02:35:59,843 INFO L226 Difference]: Without dead ends: 128 [2019-09-08 02:35:59,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:35:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-08 02:35:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-09-08 02:35:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-08 02:35:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2019-09-08 02:35:59,852 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 113 [2019-09-08 02:35:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:59,853 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2019-09-08 02:35:59,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:35:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2019-09-08 02:35:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 02:35:59,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:59,856 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:59,856 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:59,856 INFO L82 PathProgramCache]: Analyzing trace with hash -307564282, now seen corresponding path program 18 times [2019-09-08 02:35:59,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:59,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:59,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 02:36:00,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:00,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:36:00,216 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:00,821 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 02:36:00,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:00,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 02:36:00,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 02:36:00,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:00,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-08 02:36:00,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 02:36:00,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 02:36:00,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:36:00,893 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 22 states. [2019-09-08 02:36:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:01,051 INFO L93 Difference]: Finished difference Result 208 states and 250 transitions. [2019-09-08 02:36:01,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:36:01,052 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2019-09-08 02:36:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:01,053 INFO L225 Difference]: With dead ends: 208 [2019-09-08 02:36:01,053 INFO L226 Difference]: Without dead ends: 135 [2019-09-08 02:36:01,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:36:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-08 02:36:01,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2019-09-08 02:36:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-08 02:36:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2019-09-08 02:36:01,058 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 115 [2019-09-08 02:36:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:01,058 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2019-09-08 02:36:01,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 02:36:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2019-09-08 02:36:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 02:36:01,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:01,060 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:01,060 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1820357156, now seen corresponding path program 19 times [2019-09-08 02:36:01,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:01,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:01,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:01,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 02:36:01,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:01,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:01,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:36:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:01,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 02:36:01,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 02:36:01,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:01,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-08 02:36:01,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 02:36:01,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 02:36:01,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:36:01,401 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 23 states. [2019-09-08 02:36:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:01,552 INFO L93 Difference]: Finished difference Result 215 states and 259 transitions. [2019-09-08 02:36:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 02:36:01,554 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-09-08 02:36:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:01,555 INFO L225 Difference]: With dead ends: 215 [2019-09-08 02:36:01,555 INFO L226 Difference]: Without dead ends: 142 [2019-09-08 02:36:01,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:36:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-08 02:36:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 120. [2019-09-08 02:36:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-08 02:36:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2019-09-08 02:36:01,560 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 117 [2019-09-08 02:36:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:01,560 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2019-09-08 02:36:01,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 02:36:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2019-09-08 02:36:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 02:36:01,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:01,562 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:01,562 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:01,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1946541118, now seen corresponding path program 20 times [2019-09-08 02:36:01,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:01,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:01,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:36:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 02:36:01,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:01,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:01,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:36:01,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:36:01,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:01,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 02:36:01,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 02:36:01,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:01,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-08 02:36:01,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:36:01,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:36:01,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:36:01,968 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand 24 states. [2019-09-08 02:36:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:02,159 INFO L93 Difference]: Finished difference Result 222 states and 268 transitions. [2019-09-08 02:36:02,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 02:36:02,160 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 119 [2019-09-08 02:36:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:02,161 INFO L225 Difference]: With dead ends: 222 [2019-09-08 02:36:02,161 INFO L226 Difference]: Without dead ends: 149 [2019-09-08 02:36:02,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:36:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-08 02:36:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2019-09-08 02:36:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-08 02:36:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2019-09-08 02:36:02,168 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 119 [2019-09-08 02:36:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:02,168 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2019-09-08 02:36:02,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:36:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2019-09-08 02:36:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 02:36:02,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:02,170 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:02,170 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1278351904, now seen corresponding path program 21 times [2019-09-08 02:36:02,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:02,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:02,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:02,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:02,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 02:36:02,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:02,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:02,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:36:02,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-08 02:36:02,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:02,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 02:36:02,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:02,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:36:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-08 02:36:02,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:02,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 27 [2019-09-08 02:36:02,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:36:02,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:36:02,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:36:02,825 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 27 states. [2019-09-08 02:36:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:03,111 INFO L93 Difference]: Finished difference Result 231 states and 279 transitions. [2019-09-08 02:36:03,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:36:03,112 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 121 [2019-09-08 02:36:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:03,114 INFO L225 Difference]: With dead ends: 231 [2019-09-08 02:36:03,114 INFO L226 Difference]: Without dead ends: 150 [2019-09-08 02:36:03,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=308, Invalid=448, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:36:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-08 02:36:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-08 02:36:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-08 02:36:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2019-09-08 02:36:03,120 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 121 [2019-09-08 02:36:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:03,121 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2019-09-08 02:36:03,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:36:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2019-09-08 02:36:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 02:36:03,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:03,122 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:03,122 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1942005728, now seen corresponding path program 22 times [2019-09-08 02:36:03,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:03,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:03,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-08 02:36:03,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:03,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:03,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:36:03,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:36:03,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:03,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 02:36:03,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-08 02:36:03,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:03,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-08 02:36:03,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:36:03,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:36:03,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:36:03,536 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand 26 states. [2019-09-08 02:36:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:03,713 INFO L93 Difference]: Finished difference Result 254 states and 304 transitions. [2019-09-08 02:36:03,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:36:03,714 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 147 [2019-09-08 02:36:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:03,715 INFO L225 Difference]: With dead ends: 254 [2019-09-08 02:36:03,715 INFO L226 Difference]: Without dead ends: 157 [2019-09-08 02:36:03,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:36:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-08 02:36:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2019-09-08 02:36:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-08 02:36:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2019-09-08 02:36:03,721 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 147 [2019-09-08 02:36:03,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:03,721 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2019-09-08 02:36:03,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:36:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2019-09-08 02:36:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 02:36:03,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:03,723 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:03,723 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash -744869634, now seen corresponding path program 23 times [2019-09-08 02:36:03,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:03,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:03,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:03,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:03,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-08 02:36:04,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:04,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:04,057 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:36:04,685 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-08 02:36:04,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:04,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 02:36:04,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-08 02:36:04,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:04,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-08 02:36:04,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:36:04,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:36:04,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:36:04,720 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand 27 states. [2019-09-08 02:36:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:04,936 INFO L93 Difference]: Finished difference Result 261 states and 313 transitions. [2019-09-08 02:36:04,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:36:04,937 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 149 [2019-09-08 02:36:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:04,938 INFO L225 Difference]: With dead ends: 261 [2019-09-08 02:36:04,938 INFO L226 Difference]: Without dead ends: 164 [2019-09-08 02:36:04,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:36:04,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-08 02:36:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-09-08 02:36:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-08 02:36:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2019-09-08 02:36:04,948 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 149 [2019-09-08 02:36:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:04,948 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2019-09-08 02:36:04,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:36:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2019-09-08 02:36:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 02:36:04,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:04,949 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:04,950 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:04,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1556747620, now seen corresponding path program 24 times [2019-09-08 02:36:04,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:04,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:04,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:04,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:04,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-08 02:36:05,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:05,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:36:05,399 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:08,014 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-08 02:36:08,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:08,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 02:36:08,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-08 02:36:08,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:08,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-08 02:36:08,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:36:08,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:36:08,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:36:08,066 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand 28 states. [2019-09-08 02:36:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:08,279 INFO L93 Difference]: Finished difference Result 268 states and 322 transitions. [2019-09-08 02:36:08,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:36:08,280 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 151 [2019-09-08 02:36:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:08,281 INFO L225 Difference]: With dead ends: 268 [2019-09-08 02:36:08,281 INFO L226 Difference]: Without dead ends: 171 [2019-09-08 02:36:08,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:36:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-08 02:36:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2019-09-08 02:36:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-08 02:36:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2019-09-08 02:36:08,287 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 151 [2019-09-08 02:36:08,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:08,288 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2019-09-08 02:36:08,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:36:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2019-09-08 02:36:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 02:36:08,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:08,289 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:08,289 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:08,290 INFO L82 PathProgramCache]: Analyzing trace with hash -87444294, now seen corresponding path program 25 times [2019-09-08 02:36:08,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:08,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:08,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:08,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:08,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-08 02:36:08,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:08,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:36:08,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:08,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 02:36:08,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-08 02:36:08,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:08,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-08 02:36:08,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:36:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:36:08,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:36:08,836 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 29 states. [2019-09-08 02:36:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:09,038 INFO L93 Difference]: Finished difference Result 275 states and 331 transitions. [2019-09-08 02:36:09,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 02:36:09,038 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 153 [2019-09-08 02:36:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:09,039 INFO L225 Difference]: With dead ends: 275 [2019-09-08 02:36:09,040 INFO L226 Difference]: Without dead ends: 178 [2019-09-08 02:36:09,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:36:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-08 02:36:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 156. [2019-09-08 02:36:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-08 02:36:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2019-09-08 02:36:09,046 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 153 [2019-09-08 02:36:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:09,046 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2019-09-08 02:36:09,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:36:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2019-09-08 02:36:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 02:36:09,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:09,047 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:09,048 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:09,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1131188392, now seen corresponding path program 26 times [2019-09-08 02:36:09,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:09,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:09,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:36:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-08 02:36:09,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:09,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:09,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:36:09,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:36:09,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:09,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 02:36:09,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Stream closed [2019-09-08 02:36:09,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:09,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-08 02:36:09,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 02:36:09,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 02:36:09,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:36:09,582 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 30 states. [2019-09-08 02:36:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:09,868 INFO L93 Difference]: Finished difference Result 282 states and 340 transitions. [2019-09-08 02:36:09,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:36:09,869 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 155 [2019-09-08 02:36:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:09,870 INFO L225 Difference]: With dead ends: 282 [2019-09-08 02:36:09,870 INFO L226 Difference]: Without dead ends: 185 [2019-09-08 02:36:09,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:36:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-08 02:36:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2019-09-08 02:36:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-08 02:36:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2019-09-08 02:36:09,878 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 155 [2019-09-08 02:36:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:09,878 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2019-09-08 02:36:09,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 02:36:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2019-09-08 02:36:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 02:36:09,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:09,880 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:09,882 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:09,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:09,882 INFO L82 PathProgramCache]: Analyzing trace with hash 853080694, now seen corresponding path program 27 times [2019-09-08 02:36:09,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:09,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:09,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:09,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:09,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-08 02:36:10,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:10,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:10,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:36:11,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-08 02:36:11,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:11,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:36:11,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:11,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:36:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-08 02:36:11,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:11,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 33 [2019-09-08 02:36:11,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 02:36:11,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 02:36:11,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=587, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:36:11,889 INFO L87 Difference]: Start difference. First operand 158 states and 182 transitions. Second operand 33 states. [2019-09-08 02:36:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:12,158 INFO L93 Difference]: Finished difference Result 291 states and 351 transitions. [2019-09-08 02:36:12,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 02:36:12,159 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 157 [2019-09-08 02:36:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:12,160 INFO L225 Difference]: With dead ends: 291 [2019-09-08 02:36:12,161 INFO L226 Difference]: Without dead ends: 186 [2019-09-08 02:36:12,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=473, Invalid=649, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:36:12,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-08 02:36:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-08 02:36:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-08 02:36:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions. [2019-09-08 02:36:12,168 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 157 [2019-09-08 02:36:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:12,168 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 214 transitions. [2019-09-08 02:36:12,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 02:36:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions. [2019-09-08 02:36:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 02:36:12,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:12,170 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:12,170 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1433756534, now seen corresponding path program 28 times [2019-09-08 02:36:12,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:12,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:12,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-08 02:36:12,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:12,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:12,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:36:12,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:36:12,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:12,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 02:36:12,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-08 02:36:12,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:12,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-08 02:36:12,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:36:12,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:36:12,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:36:12,704 INFO L87 Difference]: Start difference. First operand 184 states and 214 transitions. Second operand 32 states. [2019-09-08 02:36:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:13,014 INFO L93 Difference]: Finished difference Result 314 states and 376 transitions. [2019-09-08 02:36:13,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 02:36:13,015 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 183 [2019-09-08 02:36:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:13,016 INFO L225 Difference]: With dead ends: 314 [2019-09-08 02:36:13,017 INFO L226 Difference]: Without dead ends: 193 [2019-09-08 02:36:13,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:36:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-08 02:36:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 186. [2019-09-08 02:36:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-08 02:36:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 216 transitions. [2019-09-08 02:36:13,025 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 216 transitions. Word has length 183 [2019-09-08 02:36:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:13,026 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 216 transitions. [2019-09-08 02:36:13,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:36:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 216 transitions. [2019-09-08 02:36:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 02:36:13,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:13,027 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:13,028 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1700186732, now seen corresponding path program 29 times [2019-09-08 02:36:13,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:13,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:13,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:13,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:13,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-08 02:36:13,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:13,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:36:13,696 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-08 02:36:15,854 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-08 02:36:15,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:15,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 02:36:15,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-08 02:36:15,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:15,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-08 02:36:15,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 02:36:15,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 02:36:15,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:36:15,914 INFO L87 Difference]: Start difference. First operand 186 states and 216 transitions. Second operand 33 states. [2019-09-08 02:36:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:16,150 INFO L93 Difference]: Finished difference Result 321 states and 385 transitions. [2019-09-08 02:36:16,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 02:36:16,151 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 185 [2019-09-08 02:36:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:16,152 INFO L225 Difference]: With dead ends: 321 [2019-09-08 02:36:16,152 INFO L226 Difference]: Without dead ends: 200 [2019-09-08 02:36:16,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:36:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-08 02:36:16,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 188. [2019-09-08 02:36:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-08 02:36:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 218 transitions. [2019-09-08 02:36:16,161 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 218 transitions. Word has length 185 [2019-09-08 02:36:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:16,162 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 218 transitions. [2019-09-08 02:36:16,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 02:36:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 218 transitions. [2019-09-08 02:36:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 02:36:16,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:16,164 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:16,164 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1647376434, now seen corresponding path program 30 times [2019-09-08 02:36:16,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:16,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:16,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:16,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:16,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2496 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-08 02:36:16,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:16,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:16,867 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:36:25,118 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-08 02:36:25,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:25,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 02:36:25,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2496 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-08 02:36:25,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:25,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-08 02:36:25,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 02:36:25,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 02:36:25,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:36:25,166 INFO L87 Difference]: Start difference. First operand 188 states and 218 transitions. Second operand 34 states. [2019-09-08 02:36:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:25,421 INFO L93 Difference]: Finished difference Result 328 states and 394 transitions. [2019-09-08 02:36:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 02:36:25,421 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 187 [2019-09-08 02:36:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:25,423 INFO L225 Difference]: With dead ends: 328 [2019-09-08 02:36:25,423 INFO L226 Difference]: Without dead ends: 207 [2019-09-08 02:36:25,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:36:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-08 02:36:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2019-09-08 02:36:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-08 02:36:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2019-09-08 02:36:25,435 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 187 [2019-09-08 02:36:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:25,435 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2019-09-08 02:36:25,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 02:36:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2019-09-08 02:36:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 02:36:25,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:25,437 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:25,437 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1725074256, now seen corresponding path program 31 times [2019-09-08 02:36:25,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:25,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:25,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:25,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:25,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-08 02:36:25,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:25,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:26,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:36:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:26,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:36:26,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:36:26,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:26,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-08 02:36:26,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 02:36:26,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 02:36:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:36:26,204 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand 35 states. [2019-09-08 02:36:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:26,466 INFO L93 Difference]: Finished difference Result 335 states and 403 transitions. [2019-09-08 02:36:26,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 02:36:26,467 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2019-09-08 02:36:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:26,468 INFO L225 Difference]: With dead ends: 335 [2019-09-08 02:36:26,469 INFO L226 Difference]: Without dead ends: 214 [2019-09-08 02:36:26,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:36:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-08 02:36:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 192. [2019-09-08 02:36:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-08 02:36:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2019-09-08 02:36:26,478 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 189 [2019-09-08 02:36:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:26,478 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2019-09-08 02:36:26,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 02:36:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2019-09-08 02:36:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 02:36:26,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:26,480 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:26,480 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:26,480 INFO L82 PathProgramCache]: Analyzing trace with hash -916730130, now seen corresponding path program 32 times [2019-09-08 02:36:26,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:26,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:26,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:26,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:36:26,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2620 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-08 02:36:27,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:27,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:27,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:36:27,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:36:27,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:27,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 02:36:27,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2620 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-08 02:36:27,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:27,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-08 02:36:27,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:36:27,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:36:27,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:36:27,134 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 36 states. [2019-09-08 02:36:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:27,420 INFO L93 Difference]: Finished difference Result 342 states and 412 transitions. [2019-09-08 02:36:27,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 02:36:27,420 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 191 [2019-09-08 02:36:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:27,422 INFO L225 Difference]: With dead ends: 342 [2019-09-08 02:36:27,422 INFO L226 Difference]: Without dead ends: 221 [2019-09-08 02:36:27,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:36:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-08 02:36:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2019-09-08 02:36:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-08 02:36:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 224 transitions. [2019-09-08 02:36:27,430 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 224 transitions. Word has length 191 [2019-09-08 02:36:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:27,430 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 224 transitions. [2019-09-08 02:36:27,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:36:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 224 transitions. [2019-09-08 02:36:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 02:36:27,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:27,432 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:27,432 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1365073140, now seen corresponding path program 33 times [2019-09-08 02:36:27,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:27,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:27,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2685 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-08 02:36:28,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:28,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:28,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:36:34,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-08 02:36:34,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:34,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 02:36:34,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:34,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:36:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2685 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:36:34,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:34,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 39 [2019-09-08 02:36:34,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 02:36:34,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 02:36:34,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:36:34,613 INFO L87 Difference]: Start difference. First operand 194 states and 224 transitions. Second operand 39 states. [2019-09-08 02:36:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:34,927 INFO L93 Difference]: Finished difference Result 351 states and 423 transitions. [2019-09-08 02:36:34,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 02:36:34,927 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 193 [2019-09-08 02:36:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:34,929 INFO L225 Difference]: With dead ends: 351 [2019-09-08 02:36:34,929 INFO L226 Difference]: Without dead ends: 222 [2019-09-08 02:36:34,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=674, Invalid=886, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:36:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-08 02:36:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-09-08 02:36:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-08 02:36:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2019-09-08 02:36:34,936 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 193 [2019-09-08 02:36:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:34,937 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2019-09-08 02:36:34,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 02:36:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2019-09-08 02:36:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 02:36:34,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:34,938 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:34,939 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:34,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1251750668, now seen corresponding path program 34 times [2019-09-08 02:36:34,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:34,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:34,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:34,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:34,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:36:35,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:35,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:35,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:36:35,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:36:35,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:35,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 02:36:35,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:36:35,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:35,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-08 02:36:35,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 02:36:35,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 02:36:35,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:36:35,681 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand 38 states. [2019-09-08 02:36:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:36,008 INFO L93 Difference]: Finished difference Result 374 states and 448 transitions. [2019-09-08 02:36:36,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:36:36,009 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 219 [2019-09-08 02:36:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:36,010 INFO L225 Difference]: With dead ends: 374 [2019-09-08 02:36:36,010 INFO L226 Difference]: Without dead ends: 229 [2019-09-08 02:36:36,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:36:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-08 02:36:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 222. [2019-09-08 02:36:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-08 02:36:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 258 transitions. [2019-09-08 02:36:36,016 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 258 transitions. Word has length 219 [2019-09-08 02:36:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:36,016 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 258 transitions. [2019-09-08 02:36:36,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 02:36:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 258 transitions. [2019-09-08 02:36:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 02:36:36,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:36,018 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:36,018 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:36,019 INFO L82 PathProgramCache]: Analyzing trace with hash 729402922, now seen corresponding path program 35 times [2019-09-08 02:36:36,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:36,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:36,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:36,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:36,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3571 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:36:36,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:36,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:36:36,756 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:39,998 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-08 02:36:39,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:40,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 02:36:40,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3571 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:36:40,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:40,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-08 02:36:40,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 02:36:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 02:36:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:36:40,057 INFO L87 Difference]: Start difference. First operand 222 states and 258 transitions. Second operand 39 states. [2019-09-08 02:36:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:40,338 INFO L93 Difference]: Finished difference Result 381 states and 457 transitions. [2019-09-08 02:36:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 02:36:40,339 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 221 [2019-09-08 02:36:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:40,340 INFO L225 Difference]: With dead ends: 381 [2019-09-08 02:36:40,340 INFO L226 Difference]: Without dead ends: 236 [2019-09-08 02:36:40,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:36:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-08 02:36:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 224. [2019-09-08 02:36:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-08 02:36:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 260 transitions. [2019-09-08 02:36:40,347 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 260 transitions. Word has length 221 [2019-09-08 02:36:40,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:40,348 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 260 transitions. [2019-09-08 02:36:40,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 02:36:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 260 transitions. [2019-09-08 02:36:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 02:36:40,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:40,349 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:40,349 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:40,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1264392648, now seen corresponding path program 36 times [2019-09-08 02:36:40,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:40,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:40,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:40,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:40,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:36:40,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:40,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:40,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:37:20,751 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-08 02:37:20,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:20,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:37:20,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:37:20,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:20,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-08 02:37:20,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 02:37:20,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 02:37:20,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:37:20,844 INFO L87 Difference]: Start difference. First operand 224 states and 260 transitions. Second operand 40 states. [2019-09-08 02:37:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:21,203 INFO L93 Difference]: Finished difference Result 388 states and 466 transitions. [2019-09-08 02:37:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 02:37:21,204 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 223 [2019-09-08 02:37:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:21,206 INFO L225 Difference]: With dead ends: 388 [2019-09-08 02:37:21,206 INFO L226 Difference]: Without dead ends: 243 [2019-09-08 02:37:21,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:37:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-08 02:37:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 226. [2019-09-08 02:37:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 02:37:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 262 transitions. [2019-09-08 02:37:21,214 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 262 transitions. Word has length 223 [2019-09-08 02:37:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:21,214 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 262 transitions. [2019-09-08 02:37:21,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 02:37:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 262 transitions. [2019-09-08 02:37:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 02:37:21,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:21,217 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:21,217 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash -6556186, now seen corresponding path program 37 times [2019-09-08 02:37:21,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:21,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:21,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:21,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:21,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3715 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:37:22,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:22,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:22,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:22,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 02:37:22,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3715 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:37:22,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:22,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-08 02:37:22,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 02:37:22,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 02:37:22,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:37:22,387 INFO L87 Difference]: Start difference. First operand 226 states and 262 transitions. Second operand 41 states. [2019-09-08 02:37:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:22,719 INFO L93 Difference]: Finished difference Result 395 states and 475 transitions. [2019-09-08 02:37:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 02:37:22,720 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 225 [2019-09-08 02:37:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:22,721 INFO L225 Difference]: With dead ends: 395 [2019-09-08 02:37:22,722 INFO L226 Difference]: Without dead ends: 250 [2019-09-08 02:37:22,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:37:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-08 02:37:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 228. [2019-09-08 02:37:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-08 02:37:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 264 transitions. [2019-09-08 02:37:22,729 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 264 transitions. Word has length 225 [2019-09-08 02:37:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:22,730 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 264 transitions. [2019-09-08 02:37:22,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 02:37:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 264 transitions. [2019-09-08 02:37:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 02:37:22,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:22,731 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:22,732 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1617673596, now seen corresponding path program 38 times [2019-09-08 02:37:22,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:22,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:22,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:22,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:22,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3790 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:37:23,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:23,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:37:23,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:23,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:37:23,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:23,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 02:37:23,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3790 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:37:23,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:23,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-08 02:37:23,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 02:37:23,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 02:37:23,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:37:23,562 INFO L87 Difference]: Start difference. First operand 228 states and 264 transitions. Second operand 42 states. [2019-09-08 02:37:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:23,908 INFO L93 Difference]: Finished difference Result 402 states and 484 transitions. [2019-09-08 02:37:23,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 02:37:23,908 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 227 [2019-09-08 02:37:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:23,911 INFO L225 Difference]: With dead ends: 402 [2019-09-08 02:37:23,911 INFO L226 Difference]: Without dead ends: 257 [2019-09-08 02:37:23,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:37:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-08 02:37:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 230. [2019-09-08 02:37:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-08 02:37:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 266 transitions. [2019-09-08 02:37:23,918 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 266 transitions. Word has length 227 [2019-09-08 02:37:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:23,919 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 266 transitions. [2019-09-08 02:37:23,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 02:37:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 266 transitions. [2019-09-08 02:37:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 02:37:23,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:23,920 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:23,921 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:23,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash 581689250, now seen corresponding path program 39 times [2019-09-08 02:37:23,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:23,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:23,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3867 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-08 02:37:24,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:24,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:24,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:37:39,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-08 02:37:39,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:39,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:37:39,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:39,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3867 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-09-08 02:37:39,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:39,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 39] total 45 [2019-09-08 02:37:39,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 02:37:39,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 02:37:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=1073, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:37:39,926 INFO L87 Difference]: Start difference. First operand 230 states and 266 transitions. Second operand 45 states. [2019-09-08 02:37:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:40,367 INFO L93 Difference]: Finished difference Result 411 states and 495 transitions. [2019-09-08 02:37:40,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 02:37:40,369 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 229 [2019-09-08 02:37:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:40,370 INFO L225 Difference]: With dead ends: 411 [2019-09-08 02:37:40,370 INFO L226 Difference]: Without dead ends: 258 [2019-09-08 02:37:40,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=911, Invalid=1159, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:37:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-08 02:37:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-08 02:37:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-08 02:37:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 298 transitions. [2019-09-08 02:37:40,377 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 298 transitions. Word has length 229 [2019-09-08 02:37:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:40,377 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 298 transitions. [2019-09-08 02:37:40,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 02:37:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 298 transitions. [2019-09-08 02:37:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 02:37:40,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:40,379 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:40,379 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:40,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:40,380 INFO L82 PathProgramCache]: Analyzing trace with hash -638183774, now seen corresponding path program 40 times [2019-09-08 02:37:40,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:40,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:40,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:40,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:40,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4840 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:37:41,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:41,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:41,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:37:41,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:37:41,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:41,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 02:37:41,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4840 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:37:41,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:41,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-08 02:37:41,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 02:37:41,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 02:37:41,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:37:41,287 INFO L87 Difference]: Start difference. First operand 256 states and 298 transitions. Second operand 44 states. [2019-09-08 02:37:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:41,675 INFO L93 Difference]: Finished difference Result 434 states and 520 transitions. [2019-09-08 02:37:41,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 02:37:41,676 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 255 [2019-09-08 02:37:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:41,677 INFO L225 Difference]: With dead ends: 434 [2019-09-08 02:37:41,677 INFO L226 Difference]: Without dead ends: 265 [2019-09-08 02:37:41,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:37:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-08 02:37:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 258. [2019-09-08 02:37:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-08 02:37:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 300 transitions. [2019-09-08 02:37:41,683 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 300 transitions. Word has length 255 [2019-09-08 02:37:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:41,684 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 300 transitions. [2019-09-08 02:37:41,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 02:37:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 300 transitions. [2019-09-08 02:37:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 02:37:41,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:41,686 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:41,686 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:41,686 INFO L82 PathProgramCache]: Analyzing trace with hash 990706368, now seen corresponding path program 41 times [2019-09-08 02:37:41,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:41,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:37:42,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:42,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:42,482 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:37:45,865 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-08 02:37:45,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:45,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:37:45,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:37:45,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:45,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-08 02:37:45,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 02:37:45,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 02:37:45,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:37:45,937 INFO L87 Difference]: Start difference. First operand 258 states and 300 transitions. Second operand 45 states. [2019-09-08 02:37:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:46,391 INFO L93 Difference]: Finished difference Result 441 states and 529 transitions. [2019-09-08 02:37:46,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 02:37:46,391 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 257 [2019-09-08 02:37:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:46,393 INFO L225 Difference]: With dead ends: 441 [2019-09-08 02:37:46,393 INFO L226 Difference]: Without dead ends: 272 [2019-09-08 02:37:46,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:37:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-08 02:37:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-08 02:37:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-08 02:37:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 302 transitions. [2019-09-08 02:37:46,399 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 302 transitions. Word has length 257 [2019-09-08 02:37:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:46,400 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 302 transitions. [2019-09-08 02:37:46,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 02:37:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 302 transitions. [2019-09-08 02:37:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 02:37:46,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:46,402 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:46,402 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:46,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:46,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1308930210, now seen corresponding path program 42 times [2019-09-08 02:37:46,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:46,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:46,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:46,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:46,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5004 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:37:47,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:47,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:47,269 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:38:56,735 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-08 02:38:56,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:56,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 02:38:56,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5004 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:38:56,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:56,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-08 02:38:56,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 02:38:56,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 02:38:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:38:56,862 INFO L87 Difference]: Start difference. First operand 260 states and 302 transitions. Second operand 46 states. [2019-09-08 02:38:57,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:57,355 INFO L93 Difference]: Finished difference Result 448 states and 538 transitions. [2019-09-08 02:38:57,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 02:38:57,356 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 259 [2019-09-08 02:38:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:57,357 INFO L225 Difference]: With dead ends: 448 [2019-09-08 02:38:57,357 INFO L226 Difference]: Without dead ends: 279 [2019-09-08 02:38:57,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:38:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-08 02:38:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 262. [2019-09-08 02:38:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 02:38:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 304 transitions. [2019-09-08 02:38:57,363 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 304 transitions. Word has length 259 [2019-09-08 02:38:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:57,363 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 304 transitions. [2019-09-08 02:38:57,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 02:38:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 304 transitions. [2019-09-08 02:38:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 02:38:57,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:57,365 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:57,365 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash 648475772, now seen corresponding path program 43 times [2019-09-08 02:38:57,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:57,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:57,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:57,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5089 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:38:58,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:58,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:58,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:38:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:58,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 02:38:58,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5089 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:38:58,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:58,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-08 02:38:58,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 02:38:58,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 02:38:58,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:38:58,459 INFO L87 Difference]: Start difference. First operand 262 states and 304 transitions. Second operand 47 states. [2019-09-08 02:38:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:58,873 INFO L93 Difference]: Finished difference Result 455 states and 547 transitions. [2019-09-08 02:38:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 02:38:58,873 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 261 [2019-09-08 02:38:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:58,875 INFO L225 Difference]: With dead ends: 455 [2019-09-08 02:38:58,875 INFO L226 Difference]: Without dead ends: 286 [2019-09-08 02:38:58,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:38:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-08 02:38:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 264. [2019-09-08 02:38:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-08 02:38:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 306 transitions. [2019-09-08 02:38:58,882 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 306 transitions. Word has length 261 [2019-09-08 02:38:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:58,883 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 306 transitions. [2019-09-08 02:38:58,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 02:38:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 306 transitions. [2019-09-08 02:38:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 02:38:58,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:58,884 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:58,885 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:58,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash 519948826, now seen corresponding path program 44 times [2019-09-08 02:38:58,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:58,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:58,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:58,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:38:58,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5176 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:38:59,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:59,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:59,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:38:59,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:38:59,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:59,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 02:38:59,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5176 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:38:59,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:59,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-08 02:38:59,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 02:38:59,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 02:38:59,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:38:59,900 INFO L87 Difference]: Start difference. First operand 264 states and 306 transitions. Second operand 48 states. [2019-09-08 02:39:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:00,309 INFO L93 Difference]: Finished difference Result 462 states and 556 transitions. [2019-09-08 02:39:00,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 02:39:00,309 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 263 [2019-09-08 02:39:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:00,311 INFO L225 Difference]: With dead ends: 462 [2019-09-08 02:39:00,312 INFO L226 Difference]: Without dead ends: 293 [2019-09-08 02:39:00,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:39:00,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-08 02:39:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 266. [2019-09-08 02:39:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-08 02:39:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 308 transitions. [2019-09-08 02:39:00,318 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 308 transitions. Word has length 263 [2019-09-08 02:39:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:00,319 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 308 transitions. [2019-09-08 02:39:00,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 02:39:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 308 transitions. [2019-09-08 02:39:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 02:39:00,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:00,321 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:00,321 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:00,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:00,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1559605304, now seen corresponding path program 45 times [2019-09-08 02:39:00,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:00,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:00,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-08 02:39:01,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:01,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:39:01,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:39:34,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-09-08 02:39:34,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:34,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 02:39:34,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:34,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:39:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-08 02:39:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 45] total 50 [2019-09-08 02:39:34,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 02:39:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 02:39:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:39:34,876 INFO L87 Difference]: Start difference. First operand 266 states and 308 transitions. Second operand 50 states. [2019-09-08 02:39:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:35,324 INFO L93 Difference]: Finished difference Result 471 states and 567 transitions. [2019-09-08 02:39:35,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 02:39:35,324 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 265 [2019-09-08 02:39:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:35,326 INFO L225 Difference]: With dead ends: 471 [2019-09-08 02:39:35,326 INFO L226 Difference]: Without dead ends: 294 [2019-09-08 02:39:35,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1136, Invalid=1414, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:39:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-08 02:39:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-09-08 02:39:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-08 02:39:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 340 transitions. [2019-09-08 02:39:35,333 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 340 transitions. Word has length 265 [2019-09-08 02:39:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:35,334 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 340 transitions. [2019-09-08 02:39:35,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 02:39:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 340 transitions. [2019-09-08 02:39:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-08 02:39:35,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:35,336 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:35,336 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:35,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1128001992, now seen corresponding path program 46 times [2019-09-08 02:39:35,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:35,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:35,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:35,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:35,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-08 02:39:36,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:36,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:39:36,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:39:36,737 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:39:36,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:36,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 02:39:36,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-08 02:39:36,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:36,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-08 02:39:36,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 02:39:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 02:39:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:39:36,796 INFO L87 Difference]: Start difference. First operand 292 states and 340 transitions. Second operand 50 states. [2019-09-08 02:39:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:37,278 INFO L93 Difference]: Finished difference Result 494 states and 592 transitions. [2019-09-08 02:39:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 02:39:37,279 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 291 [2019-09-08 02:39:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:37,280 INFO L225 Difference]: With dead ends: 494 [2019-09-08 02:39:37,280 INFO L226 Difference]: Without dead ends: 301 [2019-09-08 02:39:37,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:39:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-08 02:39:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 294. [2019-09-08 02:39:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-08 02:39:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 342 transitions. [2019-09-08 02:39:37,287 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 342 transitions. Word has length 291 [2019-09-08 02:39:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:37,287 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 342 transitions. [2019-09-08 02:39:37,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 02:39:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 342 transitions. [2019-09-08 02:39:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 02:39:37,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:37,288 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:37,289 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1864123562, now seen corresponding path program 47 times [2019-09-08 02:39:37,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:37,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:37,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:37,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6487 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-08 02:39:38,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:38,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:39:38,517 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:39:53,310 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-08 02:39:53,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:53,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 02:39:53,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6487 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-08 02:39:53,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:53,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-08 02:39:53,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 02:39:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 02:39:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:39:53,400 INFO L87 Difference]: Start difference. First operand 294 states and 342 transitions. Second operand 51 states. [2019-09-08 02:39:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:54,088 INFO L93 Difference]: Finished difference Result 501 states and 601 transitions. [2019-09-08 02:39:54,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 02:39:54,088 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 293 [2019-09-08 02:39:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:54,090 INFO L225 Difference]: With dead ends: 501 [2019-09-08 02:39:54,091 INFO L226 Difference]: Without dead ends: 308 [2019-09-08 02:39:54,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:39:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-08 02:39:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 296. [2019-09-08 02:39:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-08 02:39:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 344 transitions. [2019-09-08 02:39:54,097 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 344 transitions. Word has length 293 [2019-09-08 02:39:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:54,098 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 344 transitions. [2019-09-08 02:39:54,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 02:39:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 344 transitions. [2019-09-08 02:39:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 02:39:54,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:54,100 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:54,100 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:54,100 INFO L82 PathProgramCache]: Analyzing trace with hash -607348492, now seen corresponding path program 48 times [2019-09-08 02:39:54,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:54,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:54,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:54,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:54,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-08 02:39:55,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:55,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:39:55,100 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:40:51,386 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-08 02:40:51,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:40:51,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 02:40:51,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-08 02:40:51,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:51,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-08 02:40:51,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 02:40:51,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 02:40:51,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 02:40:51,511 INFO L87 Difference]: Start difference. First operand 296 states and 344 transitions. Second operand 52 states. [2019-09-08 02:40:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:52,021 INFO L93 Difference]: Finished difference Result 508 states and 610 transitions. [2019-09-08 02:40:52,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 02:40:52,022 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 295 [2019-09-08 02:40:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:52,023 INFO L225 Difference]: With dead ends: 508 [2019-09-08 02:40:52,023 INFO L226 Difference]: Without dead ends: 315 [2019-09-08 02:40:52,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 02:40:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-08 02:40:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 298. [2019-09-08 02:40:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-08 02:40:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 346 transitions. [2019-09-08 02:40:52,028 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 346 transitions. Word has length 295 [2019-09-08 02:40:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:52,028 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 346 transitions. [2019-09-08 02:40:52,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 02:40:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 346 transitions. [2019-09-08 02:40:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-08 02:40:52,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:52,030 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:52,030 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash 267683602, now seen corresponding path program 49 times [2019-09-08 02:40:52,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:52,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:52,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:40:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6679 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-08 02:40:53,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:53,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:40:53,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:40:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:53,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 02:40:53,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6679 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-08 02:40:53,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:53,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-08 02:40:53,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 02:40:53,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 02:40:53,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 02:40:53,234 INFO L87 Difference]: Start difference. First operand 298 states and 346 transitions. Second operand 53 states. [2019-09-08 02:40:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:53,708 INFO L93 Difference]: Finished difference Result 515 states and 619 transitions. [2019-09-08 02:40:53,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 02:40:53,708 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 297 [2019-09-08 02:40:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:53,710 INFO L225 Difference]: With dead ends: 515 [2019-09-08 02:40:53,711 INFO L226 Difference]: Without dead ends: 322 [2019-09-08 02:40:53,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 02:40:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-08 02:40:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 300. [2019-09-08 02:40:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-08 02:40:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 348 transitions. [2019-09-08 02:40:53,717 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 348 transitions. Word has length 297 [2019-09-08 02:40:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:53,717 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 348 transitions. [2019-09-08 02:40:53,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 02:40:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 348 transitions. [2019-09-08 02:40:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-08 02:40:53,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:53,719 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:53,720 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -640064080, now seen corresponding path program 50 times [2019-09-08 02:40:53,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:53,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:53,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:40:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6778 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-08 02:40:54,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:54,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:40:54,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:40:55,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:40:55,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:40:55,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 02:40:55,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6778 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:40:55,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:55,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-08 02:40:55,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-08 02:40:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-08 02:40:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 02:40:55,111 INFO L87 Difference]: Start difference. First operand 300 states and 348 transitions. Second operand 54 states. [2019-09-08 02:40:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:55,673 INFO L93 Difference]: Finished difference Result 522 states and 628 transitions. [2019-09-08 02:40:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 02:40:55,673 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 299 [2019-09-08 02:40:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:55,676 INFO L225 Difference]: With dead ends: 522 [2019-09-08 02:40:55,676 INFO L226 Difference]: Without dead ends: 329 [2019-09-08 02:40:55,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 02:40:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-08 02:40:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 302. [2019-09-08 02:40:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-08 02:40:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 350 transitions. [2019-09-08 02:40:55,682 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 350 transitions. Word has length 299 [2019-09-08 02:40:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:55,683 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 350 transitions. [2019-09-08 02:40:55,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-08 02:40:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 350 transitions. [2019-09-08 02:40:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 02:40:55,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:55,684 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:55,685 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:55,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:55,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1107225394, now seen corresponding path program 51 times [2019-09-08 02:40:55,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:55,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:55,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:55,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:40:55,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6879 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-08 02:40:56,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:56,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:40:56,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:41:43,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-09-08 02:41:43,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:43,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 02:41:43,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:43,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6879 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-09-08 02:41:43,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:43,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 51] total 57 [2019-09-08 02:41:43,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 02:41:43,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 02:41:43,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1489, Invalid=1703, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:41:43,765 INFO L87 Difference]: Start difference. First operand 302 states and 350 transitions. Second operand 57 states. [2019-09-08 02:41:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:44,366 INFO L93 Difference]: Finished difference Result 531 states and 639 transitions. [2019-09-08 02:41:44,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 02:41:44,366 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 301 [2019-09-08 02:41:44,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:44,368 INFO L225 Difference]: With dead ends: 531 [2019-09-08 02:41:44,368 INFO L226 Difference]: Without dead ends: 330 [2019-09-08 02:41:44,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1493, Invalid=1813, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 02:41:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-08 02:41:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-09-08 02:41:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-08 02:41:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 382 transitions. [2019-09-08 02:41:44,375 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 382 transitions. Word has length 301 [2019-09-08 02:41:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:44,375 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 382 transitions. [2019-09-08 02:41:44,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 02:41:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 382 transitions. [2019-09-08 02:41:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 02:41:44,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:44,378 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:44,378 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1631118898, now seen corresponding path program 52 times [2019-09-08 02:41:44,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:44,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:44,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8164 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:41:45,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:45,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:45,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:41:45,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:41:45,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:45,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 02:41:45,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8164 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:41:45,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:45,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-08 02:41:45,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-08 02:41:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-08 02:41:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 02:41:45,751 INFO L87 Difference]: Start difference. First operand 328 states and 382 transitions. Second operand 56 states. [2019-09-08 02:41:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:46,343 INFO L93 Difference]: Finished difference Result 554 states and 664 transitions. [2019-09-08 02:41:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 02:41:46,343 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 327 [2019-09-08 02:41:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:46,345 INFO L225 Difference]: With dead ends: 554 [2019-09-08 02:41:46,345 INFO L226 Difference]: Without dead ends: 337 [2019-09-08 02:41:46,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 02:41:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-08 02:41:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 330. [2019-09-08 02:41:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-08 02:41:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 384 transitions. [2019-09-08 02:41:46,353 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 384 transitions. Word has length 327 [2019-09-08 02:41:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:46,353 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 384 transitions. [2019-09-08 02:41:46,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-08 02:41:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 384 transitions. [2019-09-08 02:41:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 02:41:46,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:46,355 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:46,356 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:46,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:46,356 INFO L82 PathProgramCache]: Analyzing trace with hash -956362772, now seen corresponding path program 53 times [2019-09-08 02:41:46,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:46,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:46,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:46,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:46,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8269 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:41:47,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:47,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:47,511 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:42:11,691 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-08 02:42:11,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:11,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 02:42:11,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8269 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:42:11,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:11,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-08 02:42:11,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 02:42:11,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 02:42:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:42:11,804 INFO L87 Difference]: Start difference. First operand 330 states and 384 transitions. Second operand 57 states. [2019-09-08 02:42:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:12,431 INFO L93 Difference]: Finished difference Result 561 states and 673 transitions. [2019-09-08 02:42:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 02:42:12,431 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 329 [2019-09-08 02:42:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:12,432 INFO L225 Difference]: With dead ends: 561 [2019-09-08 02:42:12,432 INFO L226 Difference]: Without dead ends: 344 [2019-09-08 02:42:12,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:42:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-08 02:42:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 332. [2019-09-08 02:42:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-08 02:42:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 386 transitions. [2019-09-08 02:42:12,438 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 386 transitions. Word has length 329 [2019-09-08 02:42:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:12,439 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 386 transitions. [2019-09-08 02:42:12,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 02:42:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 386 transitions. [2019-09-08 02:42:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 02:42:12,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:12,441 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:12,441 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1055787382, now seen corresponding path program 54 times [2019-09-08 02:42:12,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:12,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:12,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8376 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:42:13,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:13,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:13,639 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:44:23,188 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-08 02:44:23,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:44:23,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 02:44:23,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:44:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8376 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:44:23,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:44:23,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-08 02:44:23,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-08 02:44:23,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-08 02:44:23,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 02:44:23,337 INFO L87 Difference]: Start difference. First operand 332 states and 386 transitions. Second operand 58 states. [2019-09-08 02:44:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:44:24,026 INFO L93 Difference]: Finished difference Result 568 states and 682 transitions. [2019-09-08 02:44:24,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 02:44:24,027 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 331 [2019-09-08 02:44:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:44:24,028 INFO L225 Difference]: With dead ends: 568 [2019-09-08 02:44:24,028 INFO L226 Difference]: Without dead ends: 351 [2019-09-08 02:44:24,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 02:44:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-08 02:44:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 334. [2019-09-08 02:44:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-08 02:44:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 388 transitions. [2019-09-08 02:44:24,034 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 388 transitions. Word has length 331 [2019-09-08 02:44:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:44:24,034 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 388 transitions. [2019-09-08 02:44:24,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-08 02:44:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 388 transitions. [2019-09-08 02:44:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 02:44:24,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:44:24,036 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:44:24,037 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:44:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:44:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2113557080, now seen corresponding path program 55 times [2019-09-08 02:44:24,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:44:24,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:44:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:24,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:44:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:44:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8485 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:44:25,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:44:25,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:44:25,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:44:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:44:25,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 02:44:25,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:44:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8485 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:44:25,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:44:25,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-09-08 02:44:25,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 02:44:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 02:44:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 02:44:25,508 INFO L87 Difference]: Start difference. First operand 334 states and 388 transitions. Second operand 59 states. [2019-09-08 02:44:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:44:26,214 INFO L93 Difference]: Finished difference Result 575 states and 691 transitions. [2019-09-08 02:44:26,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 02:44:26,217 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 333 [2019-09-08 02:44:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:44:26,219 INFO L225 Difference]: With dead ends: 575 [2019-09-08 02:44:26,219 INFO L226 Difference]: Without dead ends: 358 [2019-09-08 02:44:26,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 02:44:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-08 02:44:26,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 336. [2019-09-08 02:44:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-08 02:44:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 390 transitions. [2019-09-08 02:44:26,223 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 390 transitions. Word has length 333 [2019-09-08 02:44:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:44:26,223 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 390 transitions. [2019-09-08 02:44:26,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 02:44:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 390 transitions. [2019-09-08 02:44:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 02:44:26,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:44:26,225 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:44:26,225 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:44:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:44:26,226 INFO L82 PathProgramCache]: Analyzing trace with hash -722987706, now seen corresponding path program 56 times [2019-09-08 02:44:26,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:44:26,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:44:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:26,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:44:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:44:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8596 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:44:27,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:44:27,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:44:27,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:44:27,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:44:27,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:44:27,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 02:44:27,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:44:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8596 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:44:27,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:44:27,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-09-08 02:44:27,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-08 02:44:27,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-08 02:44:27,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 02:44:27,670 INFO L87 Difference]: Start difference. First operand 336 states and 390 transitions. Second operand 60 states. [2019-09-08 02:44:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:44:28,320 INFO L93 Difference]: Finished difference Result 582 states and 700 transitions. [2019-09-08 02:44:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 02:44:28,320 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 335 [2019-09-08 02:44:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:44:28,323 INFO L225 Difference]: With dead ends: 582 [2019-09-08 02:44:28,323 INFO L226 Difference]: Without dead ends: 365 [2019-09-08 02:44:28,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 02:44:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-08 02:44:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 338. [2019-09-08 02:44:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-08 02:44:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 392 transitions. [2019-09-08 02:44:28,329 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 392 transitions. Word has length 335 [2019-09-08 02:44:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:44:28,330 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 392 transitions. [2019-09-08 02:44:28,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-08 02:44:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 392 transitions. [2019-09-08 02:44:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 02:44:28,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:44:28,332 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:44:28,332 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:44:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:44:28,332 INFO L82 PathProgramCache]: Analyzing trace with hash -120648348, now seen corresponding path program 57 times [2019-09-08 02:44:28,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:44:28,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:44:28,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:28,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:44:28,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:44:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8709 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-08 02:44:29,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:44:29,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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:44:29,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:45:39,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-08 02:45:39,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:45:39,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 02:45:39,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:45:39,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:45:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8709 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-08 02:45:40,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:45:40,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 57] total 63 [2019-09-08 02:45:40,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-08 02:45:40,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-08 02:45:40,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 02:45:40,072 INFO L87 Difference]: Start difference. First operand 338 states and 392 transitions. Second operand 63 states. [2019-09-08 02:45:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:45:40,635 INFO L93 Difference]: Finished difference Result 591 states and 711 transitions. [2019-09-08 02:45:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-08 02:45:40,635 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 337 [2019-09-08 02:45:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:45:40,636 INFO L225 Difference]: With dead ends: 591 [2019-09-08 02:45:40,636 INFO L226 Difference]: Without dead ends: 366 [2019-09-08 02:45:40,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1838, Invalid=2194, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 02:45:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-08 02:45:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2019-09-08 02:45:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-08 02:45:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 424 transitions. [2019-09-08 02:45:40,642 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 424 transitions. Word has length 337 [2019-09-08 02:45:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:45:40,643 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 424 transitions. [2019-09-08 02:45:40,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-08 02:45:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 424 transitions. [2019-09-08 02:45:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-09-08 02:45:40,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:45:40,645 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:45:40,645 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:45:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:45:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash -566216348, now seen corresponding path program 58 times [2019-09-08 02:45:40,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:45:40,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:45:40,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:45:40,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:45:40,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:45:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:45:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10150 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-08 02:45:41,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:45:41,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:45:41,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:45:42,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:45:42,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:45:42,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 02:45:42,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:45:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10150 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-08 02:45:42,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:45:42,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-09-08 02:45:42,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-08 02:45:42,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-08 02:45:42,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 02:45:42,216 INFO L87 Difference]: Start difference. First operand 364 states and 424 transitions. Second operand 62 states. [2019-09-08 02:45:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:45:42,876 INFO L93 Difference]: Finished difference Result 614 states and 736 transitions. [2019-09-08 02:45:42,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 02:45:42,877 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 363 [2019-09-08 02:45:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:45:42,879 INFO L225 Difference]: With dead ends: 614 [2019-09-08 02:45:42,880 INFO L226 Difference]: Without dead ends: 373 [2019-09-08 02:45:42,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 02:45:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-08 02:45:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 366. [2019-09-08 02:45:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-08 02:45:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 426 transitions. [2019-09-08 02:45:42,884 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 426 transitions. Word has length 363 [2019-09-08 02:45:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:45:42,884 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 426 transitions. [2019-09-08 02:45:42,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-08 02:45:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 426 transitions. [2019-09-08 02:45:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-08 02:45:42,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:45:42,886 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:45:42,886 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:45:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:45:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash 165673090, now seen corresponding path program 59 times [2019-09-08 02:45:42,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:45:42,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:45:42,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:45:42,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:45:42,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:45:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:45:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10267 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-08 02:45:44,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:45:44,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:45:44,274 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:46:06,503 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-08 02:46:06,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:46:06,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 02:46:06,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:46:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10267 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-08 02:46:06,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:46:06,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-09-08 02:46:06,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-08 02:46:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-08 02:46:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 02:46:06,652 INFO L87 Difference]: Start difference. First operand 366 states and 426 transitions. Second operand 63 states. [2019-09-08 02:46:07,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:46:07,334 INFO L93 Difference]: Finished difference Result 621 states and 745 transitions. [2019-09-08 02:46:07,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-08 02:46:07,334 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 365 [2019-09-08 02:46:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:46:07,337 INFO L225 Difference]: With dead ends: 621 [2019-09-08 02:46:07,337 INFO L226 Difference]: Without dead ends: 380 [2019-09-08 02:46:07,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 02:46:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-08 02:46:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 368. [2019-09-08 02:46:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-08 02:46:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 428 transitions. [2019-09-08 02:46:07,344 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 428 transitions. Word has length 365 [2019-09-08 02:46:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:46:07,344 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 428 transitions. [2019-09-08 02:46:07,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-08 02:46:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 428 transitions. [2019-09-08 02:46:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-08 02:46:07,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:46:07,346 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:46:07,347 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:46:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:46:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash -863213536, now seen corresponding path program 60 times [2019-09-08 02:46:07,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:46:07,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:46:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:46:07,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:46:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:46:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:46:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10386 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-08 02:46:08,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:46:08,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:46:08,783 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE