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/array-examples/standard_init1_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:57:40,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:57:40,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:57:40,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:57:40,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:57:40,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:57:40,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:57:40,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:57:40,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:57:40,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:57:40,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:57:40,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:57:40,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:57:40,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:57:40,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:57:40,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:57:40,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:57:40,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:57:40,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:57:40,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:57:40,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:57:40,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:57:40,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:57:40,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:57:40,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:57:40,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:57:40,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:57:40,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:57:40,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:57:40,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:57:40,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:57:40,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:57:40,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:57:40,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:57:40,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:57:40,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:57:40,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:57:40,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:57:40,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:57:40,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:57:40,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:57:40,413 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-10-01 22:57:40,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:57:40,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:57:40,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:57:40,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:57:40,429 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:57:40,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:57:40,430 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:57:40,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:57:40,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:57:40,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:57:40,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:57:40,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:57:40,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:57:40,431 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:57:40,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:57:40,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:57:40,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:57:40,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:57:40,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:57:40,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:57:40,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:57:40,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:57:40,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:57:40,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:57:40,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:57:40,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:57:40,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:57:40,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:57:40,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:57:40,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:57:40,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:57:40,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:57:40,484 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:57:40,484 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:57:40,485 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init1_ground-1.i [2019-10-01 22:57:40,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38b3eee2/374dc3b390454e18adf9a85a8302a238/FLAG81b59b053 [2019-10-01 22:57:41,087 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:57:41,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init1_ground-1.i [2019-10-01 22:57:41,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38b3eee2/374dc3b390454e18adf9a85a8302a238/FLAG81b59b053 [2019-10-01 22:57:41,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38b3eee2/374dc3b390454e18adf9a85a8302a238 [2019-10-01 22:57:41,411 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:57:41,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:57:41,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:57:41,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:57:41,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:57:41,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:57:41" (1/1) ... [2019-10-01 22:57:41,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468dd4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41, skipping insertion in model container [2019-10-01 22:57:41,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:57:41" (1/1) ... [2019-10-01 22:57:41,436 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:57:41,455 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:57:41,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:57:41,645 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:57:41,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:57:41,695 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:57:41,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41 WrapperNode [2019-10-01 22:57:41,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:57:41,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:57:41,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:57:41,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:57:41,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41" (1/1) ... [2019-10-01 22:57:41,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41" (1/1) ... [2019-10-01 22:57:41,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41" (1/1) ... [2019-10-01 22:57:41,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41" (1/1) ... [2019-10-01 22:57:41,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41" (1/1) ... [2019-10-01 22:57:41,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41" (1/1) ... [2019-10-01 22:57:41,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41" (1/1) ... [2019-10-01 22:57:41,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:57:41,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:57:41,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:57:41,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:57:41,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41" (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-10-01 22:57:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:57:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:57:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:57:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:57:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:57:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:57:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:57:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:57:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:57:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:57:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:57:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:57:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:57:42,113 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:57:42,113 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-01 22:57:42,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:57:42 BoogieIcfgContainer [2019-10-01 22:57:42,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:57:42,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:57:42,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:57:42,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:57:42,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:57:41" (1/3) ... [2019-10-01 22:57:42,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f799582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:57:42, skipping insertion in model container [2019-10-01 22:57:42,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:41" (2/3) ... [2019-10-01 22:57:42,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f799582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:57:42, skipping insertion in model container [2019-10-01 22:57:42,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:57:42" (3/3) ... [2019-10-01 22:57:42,125 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_init1_ground-1.i [2019-10-01 22:57:42,138 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:57:42,148 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:57:42,170 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:57:42,230 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:57:42,232 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:57:42,232 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:57:42,232 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:57:42,232 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:57:42,233 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:57:42,233 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:57:42,233 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:57:42,233 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:57:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-01 22:57:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-01 22:57:42,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:42,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:42,266 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash -441053002, now seen corresponding path program 1 times [2019-10-01 22:57:42,275 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:42,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:42,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:42,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:42,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:57:42,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:57:42,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:57:42,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:57:42,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:57:42,456 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-10-01 22:57:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:42,489 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-10-01 22:57:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:57:42,493 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-01 22:57:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:42,505 INFO L225 Difference]: With dead ends: 39 [2019-10-01 22:57:42,506 INFO L226 Difference]: Without dead ends: 18 [2019-10-01 22:57:42,513 INFO L640 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-10-01 22:57:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-01 22:57:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-01 22:57:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-01 22:57:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-01 22:57:42,578 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-01 22:57:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:42,579 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-01 22:57:42,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:57:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-01 22:57:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-01 22:57:42,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:42,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:42,585 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:42,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:42,587 INFO L82 PathProgramCache]: Analyzing trace with hash 303899570, now seen corresponding path program 1 times [2019-10-01 22:57:42,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:42,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:42,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:42,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:42,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:57:42,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:57:42,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:57:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:57:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:57:42,718 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2019-10-01 22:57:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:42,746 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-10-01 22:57:42,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:57:42,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-01 22:57:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:42,751 INFO L225 Difference]: With dead ends: 30 [2019-10-01 22:57:42,751 INFO L226 Difference]: Without dead ends: 19 [2019-10-01 22:57:42,753 INFO L640 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-10-01 22:57:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-01 22:57:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-01 22:57:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-01 22:57:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-01 22:57:42,763 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2019-10-01 22:57:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:42,763 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-01 22:57:42,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:57:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-10-01 22:57:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-01 22:57:42,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:42,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:42,767 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:42,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1260126610, now seen corresponding path program 1 times [2019-10-01 22:57:42,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:42,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:42,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:42,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:42,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:42,902 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:42,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:42,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:57:42,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:57:43,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:57:43,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:57:43,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:57:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:57:43,021 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2019-10-01 22:57:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,045 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-10-01 22:57:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:57:43,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-01 22:57:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,047 INFO L225 Difference]: With dead ends: 31 [2019-10-01 22:57:43,047 INFO L226 Difference]: Without dead ends: 20 [2019-10-01 22:57:43,048 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-10-01 22:57:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-01 22:57:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-01 22:57:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-01 22:57:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-01 22:57:43,054 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2019-10-01 22:57:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,054 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-01 22:57:43,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:57:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-01 22:57:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 22:57:43,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,056 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,056 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1794669362, now seen corresponding path program 2 times [2019-10-01 22:57:43,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:43,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,119 INFO L224 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-10-01 22:57:43,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:43,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:43,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:43,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:57:43,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:57:43,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:57:43,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:57:43,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:57:43,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:57:43,208 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2019-10-01 22:57:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,243 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-10-01 22:57:43,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:57:43,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-01 22:57:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,245 INFO L225 Difference]: With dead ends: 32 [2019-10-01 22:57:43,246 INFO L226 Difference]: Without dead ends: 21 [2019-10-01 22:57:43,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-10-01 22:57:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-01 22:57:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-01 22:57:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-01 22:57:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-01 22:57:43,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2019-10-01 22:57:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,255 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-01 22:57:43,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:57:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-01 22:57:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:57:43,258 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,258 INFO L411 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,259 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2004063982, now seen corresponding path program 3 times [2019-10-01 22:57:43,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:43,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:43,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,354 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:43,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:43,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:57:43,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:43,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:57:43,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:43,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 22:57:43,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:57:43,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:57:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:57:43,455 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2019-10-01 22:57:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,492 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-10-01 22:57:43,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:57:43,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-10-01 22:57:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,495 INFO L225 Difference]: With dead ends: 33 [2019-10-01 22:57:43,495 INFO L226 Difference]: Without dead ends: 22 [2019-10-01 22:57:43,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:57:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-01 22:57:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-01 22:57:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-01 22:57:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-10-01 22:57:43,507 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2019-10-01 22:57:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,507 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-10-01 22:57:43,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:57:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-10-01 22:57:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 22:57:43,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,509 INFO L411 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,509 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,510 INFO L82 PathProgramCache]: Analyzing trace with hash -94637390, now seen corresponding path program 4 times [2019-10-01 22:57:43,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:43,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,628 INFO L224 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-10-01 22:57:43,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:43,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:43,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:43,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:57:43,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:57:43,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:57:43,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:57:43,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:57:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:57:43,721 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2019-10-01 22:57:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,757 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-10-01 22:57:43,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:57:43,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-01 22:57:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,760 INFO L225 Difference]: With dead ends: 34 [2019-10-01 22:57:43,761 INFO L226 Difference]: Without dead ends: 23 [2019-10-01 22:57:43,761 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 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-10-01 22:57:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-01 22:57:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-01 22:57:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-01 22:57:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-01 22:57:43,766 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2019-10-01 22:57:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,766 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-01 22:57:43,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:57:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-01 22:57:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-01 22:57:43,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,767 INFO L411 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,768 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,768 INFO L82 PathProgramCache]: Analyzing trace with hash -729870482, now seen corresponding path program 5 times [2019-10-01 22:57:43,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:43,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,842 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:43,892 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-01 22:57:43,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:43,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:57:43,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:43,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:57:43,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:57:43,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:57:43,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:57:43,911 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-10-01 22:57:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,939 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-10-01 22:57:43,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:57:43,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-10-01 22:57:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,941 INFO L225 Difference]: With dead ends: 35 [2019-10-01 22:57:43,942 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 22:57:43,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 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-10-01 22:57:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 22:57:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-01 22:57:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 22:57:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-01 22:57:43,950 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2019-10-01 22:57:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,955 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-01 22:57:43,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:57:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-01 22:57:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-01 22:57:43,956 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,956 INFO L411 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,957 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1052740146, now seen corresponding path program 6 times [2019-10-01 22:57:43,958 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:44,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:44,066 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:44,088 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:57:44,111 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-01 22:57:44,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:44,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:57:44,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:44,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:44,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 22:57:44,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:57:44,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:57:44,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:57:44,156 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2019-10-01 22:57:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:44,179 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-10-01 22:57:44,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:57:44,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-10-01 22:57:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:44,181 INFO L225 Difference]: With dead ends: 36 [2019-10-01 22:57:44,181 INFO L226 Difference]: Without dead ends: 25 [2019-10-01 22:57:44,182 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 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-10-01 22:57:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-01 22:57:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-01 22:57:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-01 22:57:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-01 22:57:44,187 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2019-10-01 22:57:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:44,187 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-01 22:57:44,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:57:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-01 22:57:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 22:57:44,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:44,188 INFO L411 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:44,189 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash 479094766, now seen corresponding path program 7 times [2019-10-01 22:57:44,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:44,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:44,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:44,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:44,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:44,274 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:44,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:44,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:57:44,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:44,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:44,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:57:44,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:57:44,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:57:44,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:57:44,346 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2019-10-01 22:57:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:44,382 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-10-01 22:57:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:57:44,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-10-01 22:57:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:44,383 INFO L225 Difference]: With dead ends: 37 [2019-10-01 22:57:44,383 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:57:44,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:57:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:57:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:57:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:57:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-10-01 22:57:44,392 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2019-10-01 22:57:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:44,393 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-10-01 22:57:44,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:57:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-10-01 22:57:44,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 22:57:44,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:44,395 INFO L411 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:44,395 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:44,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:44,395 INFO L82 PathProgramCache]: Analyzing trace with hash -124042830, now seen corresponding path program 8 times [2019-10-01 22:57:44,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:44,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:44,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:44,531 INFO L224 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-10-01 22:57:44,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:44,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:44,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:44,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:57:44,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:44,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:44,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:57:44,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:57:44,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:57:44,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:57:44,614 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 12 states. [2019-10-01 22:57:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:44,646 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-10-01 22:57:44,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:57:44,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-10-01 22:57:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:44,648 INFO L225 Difference]: With dead ends: 38 [2019-10-01 22:57:44,648 INFO L226 Difference]: Without dead ends: 27 [2019-10-01 22:57:44,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 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-10-01 22:57:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-01 22:57:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-01 22:57:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:57:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-01 22:57:44,653 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2019-10-01 22:57:44,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:44,653 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-01 22:57:44,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:57:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-01 22:57:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-01 22:57:44,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:44,654 INFO L411 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:44,655 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:44,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:44,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1641439122, now seen corresponding path program 9 times [2019-10-01 22:57:44,655 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:44,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:44,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:44,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:44,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:44,772 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:44,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:44,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:57:44,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:44,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:57:44,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:44,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:44,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 22:57:44,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:57:44,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:57:44,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:57:44,872 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2019-10-01 22:57:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:44,901 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-01 22:57:44,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:57:44,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-10-01 22:57:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:44,903 INFO L225 Difference]: With dead ends: 39 [2019-10-01 22:57:44,903 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:57:44,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:57:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:57:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-01 22:57:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:57:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-10-01 22:57:44,908 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2019-10-01 22:57:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:44,908 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-10-01 22:57:44,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:57:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-10-01 22:57:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 22:57:44,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:44,909 INFO L411 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:44,909 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1436083918, now seen corresponding path program 10 times [2019-10-01 22:57:44,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:44,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:44,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:45,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:45,047 INFO L224 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-10-01 22:57:45,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:45,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:45,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:45,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:57:45,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:45,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:45,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:57:45,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:57:45,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:57:45,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:57:45,143 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2019-10-01 22:57:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:45,170 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-10-01 22:57:45,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:57:45,174 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-10-01 22:57:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:45,175 INFO L225 Difference]: With dead ends: 40 [2019-10-01 22:57:45,175 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:57:45,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 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-10-01 22:57:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:57:45,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-01 22:57:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 22:57:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-10-01 22:57:45,183 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2019-10-01 22:57:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:45,184 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-01 22:57:45,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:57:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-10-01 22:57:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-01 22:57:45,186 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:45,186 INFO L411 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:45,187 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:45,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:45,187 INFO L82 PathProgramCache]: Analyzing trace with hash 634960110, now seen corresponding path program 11 times [2019-10-01 22:57:45,187 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:45,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:45,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:45,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:45,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:45,341 INFO L224 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-10-01 22:57:45,368 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-10-01 22:57:45,413 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-01 22:57:45,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:45,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:57:45,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:45,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:45,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 22:57:45,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:57:45,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:57:45,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:57:45,448 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-10-01 22:57:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:45,476 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-10-01 22:57:45,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:57:45,477 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-10-01 22:57:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:45,478 INFO L225 Difference]: With dead ends: 41 [2019-10-01 22:57:45,478 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:57:45,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 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-10-01 22:57:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:57:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-01 22:57:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-01 22:57:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-10-01 22:57:45,483 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2019-10-01 22:57:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:45,483 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-10-01 22:57:45,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:57:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-10-01 22:57:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 22:57:45,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:45,484 INFO L411 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:45,484 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:45,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash 412815538, now seen corresponding path program 12 times [2019-10-01 22:57:45,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:45,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:45,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:45,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:45,649 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:45,674 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:57:45,738 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:57:45,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:45,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:57:45,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:45,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:45,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 22:57:45,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:57:45,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:57:45,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:57:45,767 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2019-10-01 22:57:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:45,794 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-10-01 22:57:45,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:57:45,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-10-01 22:57:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:45,796 INFO L225 Difference]: With dead ends: 42 [2019-10-01 22:57:45,796 INFO L226 Difference]: Without dead ends: 31 [2019-10-01 22:57:45,797 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 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-10-01 22:57:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-01 22:57:45,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-01 22:57:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:57:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-10-01 22:57:45,801 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2019-10-01 22:57:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:45,801 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-10-01 22:57:45,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:57:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-10-01 22:57:45,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-01 22:57:45,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:45,803 INFO L411 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:45,803 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2116268398, now seen corresponding path program 13 times [2019-10-01 22:57:45,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:45,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:45,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:45,955 INFO L224 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-10-01 22:57:45,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:46,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:57:46,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:46,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:46,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:57:46,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:57:46,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:57:46,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:57:46,071 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 17 states. [2019-10-01 22:57:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:46,100 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-01 22:57:46,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:57:46,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-10-01 22:57:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:46,101 INFO L225 Difference]: With dead ends: 43 [2019-10-01 22:57:46,101 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 22:57:46,102 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 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-10-01 22:57:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 22:57:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-01 22:57:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:57:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-10-01 22:57:46,106 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2019-10-01 22:57:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:46,107 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-10-01 22:57:46,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:57:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-10-01 22:57:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:57:46,107 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:46,108 INFO L411 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:46,108 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:46,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash -911267790, now seen corresponding path program 14 times [2019-10-01 22:57:46,108 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:46,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:46,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:46,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:46,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:46,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:46,268 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:46,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:46,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:46,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:46,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:57:46,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:46,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:46,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:57:46,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:57:46,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:57:46,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:57:46,360 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 18 states. [2019-10-01 22:57:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:46,396 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-10-01 22:57:46,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:57:46,397 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-10-01 22:57:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:46,398 INFO L225 Difference]: With dead ends: 44 [2019-10-01 22:57:46,398 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 22:57:46,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 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-10-01 22:57:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 22:57:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-01 22:57:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 22:57:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-10-01 22:57:46,403 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2019-10-01 22:57:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:46,404 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-10-01 22:57:46,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:57:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-10-01 22:57:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-01 22:57:46,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:46,405 INFO L411 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:46,405 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash -275609106, now seen corresponding path program 15 times [2019-10-01 22:57:46,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:46,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:46,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:46,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:46,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:46,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:46,580 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:46,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:46,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:57:46,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:46,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:57:46,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:46,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:46,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:57:46,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:57:46,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:57:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:57:46,786 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 19 states. [2019-10-01 22:57:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:46,834 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-10-01 22:57:46,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:57:46,834 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-10-01 22:57:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:46,835 INFO L225 Difference]: With dead ends: 45 [2019-10-01 22:57:46,835 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 22:57:46,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:57:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 22:57:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-01 22:57:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-01 22:57:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-10-01 22:57:46,840 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2019-10-01 22:57:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:46,840 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-10-01 22:57:46,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:57:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-10-01 22:57:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 22:57:46,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:46,842 INFO L411 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:46,842 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:46,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:46,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2045026382, now seen corresponding path program 16 times [2019-10-01 22:57:46,842 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:46,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:46,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:46,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:47,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:47,020 INFO L224 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-10-01 22:57:47,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:47,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:47,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:47,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:57:47,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:47,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:47,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:57:47,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:57:47,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:57:47,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:57:47,119 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 20 states. [2019-10-01 22:57:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:47,156 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-10-01 22:57:47,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:57:47,157 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-10-01 22:57:47,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:47,158 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:57:47,158 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 22:57:47,159 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 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-10-01 22:57:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 22:57:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-01 22:57:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-01 22:57:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-10-01 22:57:47,163 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2019-10-01 22:57:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:47,163 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-10-01 22:57:47,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:57:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-10-01 22:57:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-01 22:57:47,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:47,164 INFO L411 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:47,165 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:47,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1062387090, now seen corresponding path program 17 times [2019-10-01 22:57:47,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:47,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:47,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:47,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:47,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:47,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:47,370 INFO L224 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-10-01 22:57:47,403 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:47,531 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-10-01 22:57:47,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:47,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:57:47,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:47,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:47,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 22:57:47,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:57:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:57:47,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:57:47,562 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 21 states. [2019-10-01 22:57:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:47,597 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-10-01 22:57:47,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:57:47,602 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-10-01 22:57:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:47,602 INFO L225 Difference]: With dead ends: 47 [2019-10-01 22:57:47,602 INFO L226 Difference]: Without dead ends: 36 [2019-10-01 22:57:47,603 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 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-10-01 22:57:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-01 22:57:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-01 22:57:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 22:57:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-10-01 22:57:47,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2019-10-01 22:57:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:47,608 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-10-01 22:57:47,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:57:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-10-01 22:57:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 22:57:47,609 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:47,609 INFO L411 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:47,609 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash -665340110, now seen corresponding path program 18 times [2019-10-01 22:57:47,610 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:47,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:47,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:47,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:47,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:47,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:47,824 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:47,857 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:57:47,986 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 22:57:47,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:47,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:57:47,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:48,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:48,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 22:57:48,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:57:48,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:57:48,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:57:48,013 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 22 states. [2019-10-01 22:57:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:48,050 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-10-01 22:57:48,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:57:48,050 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-10-01 22:57:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:48,051 INFO L225 Difference]: With dead ends: 48 [2019-10-01 22:57:48,051 INFO L226 Difference]: Without dead ends: 37 [2019-10-01 22:57:48,052 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:57:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-01 22:57:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-01 22:57:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 22:57:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-01 22:57:48,056 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2019-10-01 22:57:48,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:48,056 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-01 22:57:48,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:57:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-01 22:57:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:57:48,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:48,057 INFO L411 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:48,057 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:48,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1241785618, now seen corresponding path program 19 times [2019-10-01 22:57:48,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:48,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:48,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:48,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:48,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:48,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:48,333 INFO L224 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-10-01 22:57:48,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:48,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:57:48,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:48,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:48,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:57:48,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:57:48,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:57:48,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:57:48,418 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 23 states. [2019-10-01 22:57:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:48,478 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-10-01 22:57:48,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:57:48,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2019-10-01 22:57:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:48,479 INFO L225 Difference]: With dead ends: 49 [2019-10-01 22:57:48,480 INFO L226 Difference]: Without dead ends: 38 [2019-10-01 22:57:48,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:57:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-01 22:57:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-01 22:57:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-01 22:57:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-10-01 22:57:48,484 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2019-10-01 22:57:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:48,484 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-10-01 22:57:48,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:57:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-10-01 22:57:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-01 22:57:48,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:48,485 INFO L411 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:48,486 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1931727182, now seen corresponding path program 20 times [2019-10-01 22:57:48,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:48,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:48,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:48,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:48,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:48,757 INFO L224 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-10-01 22:57:48,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:48,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:48,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:48,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:57:48,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Stream Closed [2019-10-01 22:57:48,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:48,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:57:48,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:57:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:57:48,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:57:48,856 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 24 states. [2019-10-01 22:57:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:48,891 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-10-01 22:57:48,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:57:48,894 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-10-01 22:57:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:48,894 INFO L225 Difference]: With dead ends: 50 [2019-10-01 22:57:48,895 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:57:48,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 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-10-01 22:57:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:57:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-01 22:57:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 22:57:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-10-01 22:57:48,905 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 33 [2019-10-01 22:57:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:48,906 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-10-01 22:57:48,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:57:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-10-01 22:57:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:57:48,907 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:48,907 INFO L411 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:48,909 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1845079186, now seen corresponding path program 21 times [2019-10-01 22:57:48,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:48,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:48,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:48,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:48,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:49,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:49,238 INFO L224 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-10-01 22:57:49,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:57:49,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 22:57:49,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:49,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:57:49,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:49,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:49,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 22:57:49,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:57:49,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:57:49,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:57:49,633 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 25 states. [2019-10-01 22:57:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:49,670 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-10-01 22:57:49,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:57:49,670 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2019-10-01 22:57:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:49,671 INFO L225 Difference]: With dead ends: 51 [2019-10-01 22:57:49,671 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 22:57:49,672 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:57:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 22:57:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-01 22:57:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-01 22:57:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-10-01 22:57:49,676 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2019-10-01 22:57:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:49,676 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-10-01 22:57:49,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:57:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-10-01 22:57:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-01 22:57:49,677 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:49,677 INFO L411 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:49,677 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:49,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:49,678 INFO L82 PathProgramCache]: Analyzing trace with hash 841008690, now seen corresponding path program 22 times [2019-10-01 22:57:49,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:49,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:49,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:49,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:49,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:50,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:50,035 INFO L224 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-10-01 22:57:50,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:50,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:50,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:50,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:57:50,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:50,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:50,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:57:50,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:57:50,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:57:50,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:57:50,157 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 26 states. [2019-10-01 22:57:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:50,199 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-10-01 22:57:50,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:57:50,202 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2019-10-01 22:57:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:50,203 INFO L225 Difference]: With dead ends: 52 [2019-10-01 22:57:50,203 INFO L226 Difference]: Without dead ends: 41 [2019-10-01 22:57:50,204 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:57:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-01 22:57:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-01 22:57:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-01 22:57:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-10-01 22:57:50,210 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2019-10-01 22:57:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:50,211 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-10-01 22:57:50,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:57:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-10-01 22:57:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-01 22:57:50,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:50,212 INFO L411 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:50,212 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:50,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1789613074, now seen corresponding path program 23 times [2019-10-01 22:57:50,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:50,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:50,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:50,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:50,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:50,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:50,551 INFO L224 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-10-01 22:57:50,587 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:50,761 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-01 22:57:50,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:50,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:57:50,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:50,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:50,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 22:57:50,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:57:50,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:57:50,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:57:50,811 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 27 states. [2019-10-01 22:57:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:50,860 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-10-01 22:57:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:57:50,860 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-10-01 22:57:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:50,861 INFO L225 Difference]: With dead ends: 53 [2019-10-01 22:57:50,861 INFO L226 Difference]: Without dead ends: 42 [2019-10-01 22:57:50,862 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:57:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-01 22:57:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-01 22:57:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 22:57:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-10-01 22:57:50,867 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 36 [2019-10-01 22:57:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:50,867 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-10-01 22:57:50,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:57:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-10-01 22:57:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 22:57:50,868 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:50,868 INFO L411 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:50,869 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1734509134, now seen corresponding path program 24 times [2019-10-01 22:57:50,869 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:50,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:50,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:50,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:50,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:51,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:51,195 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:51,230 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:57:52,552 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 22:57:52,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:52,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:57:52,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:52,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:52,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 22:57:52,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:57:52,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:57:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:57:52,586 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 28 states. [2019-10-01 22:57:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:52,637 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-10-01 22:57:52,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:57:52,638 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 37 [2019-10-01 22:57:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:52,639 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:57:52,639 INFO L226 Difference]: Without dead ends: 43 [2019-10-01 22:57:52,639 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:57:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-01 22:57:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-01 22:57:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:57:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-10-01 22:57:52,650 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 37 [2019-10-01 22:57:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:52,650 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-10-01 22:57:52,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:57:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-10-01 22:57:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-01 22:57:52,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:52,651 INFO L411 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:52,651 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:52,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:52,652 INFO L82 PathProgramCache]: Analyzing trace with hash -26286994, now seen corresponding path program 25 times [2019-10-01 22:57:52,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:52,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:52,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:53,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:53,027 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:53,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:57:53,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:53,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:53,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 22:57:53,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:57:53,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:57:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:57:53,125 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 29 states. [2019-10-01 22:57:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:53,176 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-10-01 22:57:53,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:57:53,177 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2019-10-01 22:57:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:53,177 INFO L225 Difference]: With dead ends: 55 [2019-10-01 22:57:53,178 INFO L226 Difference]: Without dead ends: 44 [2019-10-01 22:57:53,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 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-10-01 22:57:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-01 22:57:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-01 22:57:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 22:57:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-10-01 22:57:53,183 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 38 [2019-10-01 22:57:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:53,183 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-10-01 22:57:53,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:57:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-10-01 22:57:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 22:57:53,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:53,184 INFO L411 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:53,185 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:53,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:53,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1388991794, now seen corresponding path program 26 times [2019-10-01 22:57:53,186 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:53,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:53,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:53,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:53,569 INFO L224 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-10-01 22:57:53,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:53,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:53,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:53,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:57:53,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:53,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:53,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 22:57:53,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:57:53,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:57:53,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:57:53,653 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 30 states. [2019-10-01 22:57:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:53,714 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-10-01 22:57:53,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:57:53,715 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2019-10-01 22:57:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:53,716 INFO L225 Difference]: With dead ends: 56 [2019-10-01 22:57:53,716 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 22:57:53,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 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-10-01 22:57:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 22:57:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-01 22:57:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-01 22:57:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-10-01 22:57:53,720 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 39 [2019-10-01 22:57:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:53,720 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-10-01 22:57:53,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:57:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-10-01 22:57:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 22:57:53,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:53,721 INFO L411 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:53,722 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:53,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:53,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1982006034, now seen corresponding path program 27 times [2019-10-01 22:57:53,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:53,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:53,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:53,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:53,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:54,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:54,136 INFO L224 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-10-01 22:57:54,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:57:55,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 22:57:55,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:55,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:57:55,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:55,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:55,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 22:57:55,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:57:55,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:57:55,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:57:55,764 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 31 states. [2019-10-01 22:57:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:55,821 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-10-01 22:57:55,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:57:55,822 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2019-10-01 22:57:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:55,823 INFO L225 Difference]: With dead ends: 57 [2019-10-01 22:57:55,823 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 22:57:55,823 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:57:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 22:57:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-01 22:57:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 22:57:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-10-01 22:57:55,826 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2019-10-01 22:57:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:55,827 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-10-01 22:57:55,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:57:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-10-01 22:57:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 22:57:55,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:55,828 INFO L411 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:55,828 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:55,828 INFO L82 PathProgramCache]: Analyzing trace with hash 891243698, now seen corresponding path program 28 times [2019-10-01 22:57:55,829 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:55,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:55,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:56,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:56,276 INFO L224 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-10-01 22:57:56,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:56,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:56,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:56,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:57:56,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:57:56,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:56,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 22:57:56,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 22:57:56,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 22:57:56,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:57:56,356 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 32 states. [2019-10-01 22:57:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:56,423 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-10-01 22:57:56,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:57:56,424 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2019-10-01 22:57:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:56,425 INFO L225 Difference]: With dead ends: 58 [2019-10-01 22:57:56,425 INFO L226 Difference]: Without dead ends: 47 [2019-10-01 22:57:56,426 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:57:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-01 22:57:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-01 22:57:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:57:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-10-01 22:57:56,429 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 41 [2019-10-01 22:57:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:56,429 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-10-01 22:57:56,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 22:57:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-10-01 22:57:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:57:56,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:56,430 INFO L411 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:56,430 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:56,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:56,431 INFO L82 PathProgramCache]: Analyzing trace with hash -232327826, now seen corresponding path program 29 times [2019-10-01 22:57:56,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:56,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:56,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:56,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:56,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:56,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:56,991 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:57,050 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:57,518 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-10-01 22:57:57,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:57,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 22:57:57,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:57,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:57,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 22:57:57,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 22:57:57,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 22:57:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:57:57,543 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 33 states. [2019-10-01 22:57:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:57,588 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-10-01 22:57:57,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 22:57:57,589 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2019-10-01 22:57:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:57,590 INFO L225 Difference]: With dead ends: 59 [2019-10-01 22:57:57,590 INFO L226 Difference]: Without dead ends: 48 [2019-10-01 22:57:57,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 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-10-01 22:57:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-01 22:57:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-01 22:57:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-01 22:57:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-10-01 22:57:57,593 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2019-10-01 22:57:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:57,594 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-10-01 22:57:57,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 22:57:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-10-01 22:57:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 22:57:57,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:57,595 INFO L411 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:57,595 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:57,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:57,596 INFO L82 PathProgramCache]: Analyzing trace with hash -703306702, now seen corresponding path program 30 times [2019-10-01 22:57:57,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:57,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:57,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:57,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:58,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:58,122 INFO L224 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-10-01 22:57:58,177 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:58:06,428 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-01 22:58:06,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:06,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 22:58:06,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:06,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:06,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 22:58:06,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:58:06,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:58:06,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:58:06,474 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 34 states. [2019-10-01 22:58:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:06,528 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-10-01 22:58:06,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 22:58:06,528 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-10-01 22:58:06,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:06,529 INFO L225 Difference]: With dead ends: 60 [2019-10-01 22:58:06,529 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:58:06,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:58:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:58:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-10-01 22:58:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 22:58:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-10-01 22:58:06,535 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 43 [2019-10-01 22:58:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:06,538 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-10-01 22:58:06,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:58:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-10-01 22:58:06,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:58:06,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:06,540 INFO L411 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:06,540 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:06,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1876217326, now seen corresponding path program 31 times [2019-10-01 22:58:06,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:06,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:06,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:06,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:06,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:06,988 INFO L224 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-10-01 22:58:07,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:07,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:58:07,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:07,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:07,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 22:58:07,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:58:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:58:07,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:58:07,083 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 35 states. [2019-10-01 22:58:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:07,137 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-10-01 22:58:07,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:58:07,137 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2019-10-01 22:58:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:07,138 INFO L225 Difference]: With dead ends: 61 [2019-10-01 22:58:07,138 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 22:58:07,139 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 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-10-01 22:58:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 22:58:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-01 22:58:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 22:58:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-10-01 22:58:07,141 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2019-10-01 22:58:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:07,142 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-10-01 22:58:07,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:58:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-10-01 22:58:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 22:58:07,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:07,143 INFO L411 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:07,143 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:07,143 INFO L82 PathProgramCache]: Analyzing trace with hash 237083570, now seen corresponding path program 32 times [2019-10-01 22:58:07,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:07,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:07,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:07,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:07,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:07,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:07,613 INFO L224 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-10-01 22:58:07,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:58:07,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:58:07,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:07,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:58:07,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:07,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:07,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:58:07,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:58:07,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:58:07,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:58:07,716 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 36 states. [2019-10-01 22:58:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:07,776 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-10-01 22:58:07,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:58:07,776 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 45 [2019-10-01 22:58:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:07,777 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:58:07,777 INFO L226 Difference]: Without dead ends: 51 [2019-10-01 22:58:07,778 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 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-10-01 22:58:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-01 22:58:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-01 22:58:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 22:58:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-10-01 22:58:07,782 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2019-10-01 22:58:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:07,782 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-10-01 22:58:07,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:58:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-10-01 22:58:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 22:58:07,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:07,784 INFO L411 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:07,784 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 963544686, now seen corresponding path program 33 times [2019-10-01 22:58:07,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:07,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:07,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:07,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:07,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:08,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:08,313 INFO L224 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-10-01 22:58:08,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:58:14,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-01 22:58:14,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:14,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:58:14,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:14,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:14,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 22:58:14,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 22:58:14,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 22:58:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:58:14,979 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 37 states. [2019-10-01 22:58:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:15,028 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-10-01 22:58:15,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 22:58:15,028 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2019-10-01 22:58:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:15,029 INFO L225 Difference]: With dead ends: 63 [2019-10-01 22:58:15,029 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 22:58:15,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:58:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 22:58:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-10-01 22:58:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:58:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-10-01 22:58:15,036 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 46 [2019-10-01 22:58:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:15,037 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-10-01 22:58:15,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 22:58:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-10-01 22:58:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:58:15,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:15,038 INFO L411 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:15,038 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:15,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2009002802, now seen corresponding path program 34 times [2019-10-01 22:58:15,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:15,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:15,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:15,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:15,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:15,665 INFO L224 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-10-01 22:58:15,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:58:15,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:58:15,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:15,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 22:58:15,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:15,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:15,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 22:58:15,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:58:15,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:58:15,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:58:15,782 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 38 states. [2019-10-01 22:58:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:15,831 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-10-01 22:58:15,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 22:58:15,831 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 47 [2019-10-01 22:58:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:15,832 INFO L225 Difference]: With dead ends: 64 [2019-10-01 22:58:15,832 INFO L226 Difference]: Without dead ends: 53 [2019-10-01 22:58:15,833 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 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-10-01 22:58:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-01 22:58:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-01 22:58:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-01 22:58:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-10-01 22:58:15,837 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 47 [2019-10-01 22:58:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:15,837 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-10-01 22:58:15,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:58:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-10-01 22:58:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-01 22:58:15,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:15,838 INFO L411 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:15,838 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash 58466030, now seen corresponding path program 35 times [2019-10-01 22:58:15,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:15,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:15,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:16,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:16,403 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:16,446 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:58:20,409 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-10-01 22:58:20,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:20,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 22:58:20,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:20,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:20,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 22:58:20,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 22:58:20,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 22:58:20,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:58:20,442 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 39 states. [2019-10-01 22:58:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:20,488 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-10-01 22:58:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:58:20,491 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 48 [2019-10-01 22:58:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:20,492 INFO L225 Difference]: With dead ends: 65 [2019-10-01 22:58:20,492 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 22:58:20,493 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:58:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 22:58:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-01 22:58:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-01 22:58:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-10-01 22:58:20,499 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 48 [2019-10-01 22:58:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:20,500 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-10-01 22:58:20,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 22:58:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-10-01 22:58:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-01 22:58:20,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:20,501 INFO L411 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:20,503 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash -278631758, now seen corresponding path program 36 times [2019-10-01 22:58:20,503 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:20,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:20,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:21,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:21,327 INFO L224 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-10-01 22:58:21,378 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:58:33,511 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:58:33,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:33,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 22:58:33,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:33,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:33,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-10-01 22:58:33,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 22:58:33,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 22:58:33,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:58:33,557 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 40 states. [2019-10-01 22:58:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:33,636 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-10-01 22:58:33,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 22:58:33,637 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2019-10-01 22:58:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:33,638 INFO L225 Difference]: With dead ends: 66 [2019-10-01 22:58:33,638 INFO L226 Difference]: Without dead ends: 55 [2019-10-01 22:58:33,639 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:58:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-01 22:58:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-01 22:58:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 22:58:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-10-01 22:58:33,645 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2019-10-01 22:58:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:33,645 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-10-01 22:58:33,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 22:58:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-10-01 22:58:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-01 22:58:33,646 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:33,646 INFO L411 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:33,647 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2138728594, now seen corresponding path program 37 times [2019-10-01 22:58:33,647 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:33,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:33,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:34,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:34,452 INFO L224 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-10-01 22:58:34,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:34,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 22:58:34,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:58:34,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:34,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 22:58:34,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:58:34,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:58:34,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:58:34,557 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 41 states. [2019-10-01 22:58:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:34,615 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-10-01 22:58:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:58:34,615 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2019-10-01 22:58:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:34,616 INFO L225 Difference]: With dead ends: 67 [2019-10-01 22:58:34,616 INFO L226 Difference]: Without dead ends: 56 [2019-10-01 22:58:34,617 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 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-10-01 22:58:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-01 22:58:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-01 22:58:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-01 22:58:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-10-01 22:58:34,620 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2019-10-01 22:58:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:34,621 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-10-01 22:58:34,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:58:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-10-01 22:58:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 22:58:34,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:34,621 INFO L411 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:34,622 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:34,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash 327811634, now seen corresponding path program 38 times [2019-10-01 22:58:34,622 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:34,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:34,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:34,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:34,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:35,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:35,257 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:35,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:58:35,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:58:35,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:35,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:58:35,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:35,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:35,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 22:58:35,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:58:35,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:58:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:58:35,367 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 42 states. [2019-10-01 22:58:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:35,447 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-10-01 22:58:35,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:58:35,448 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 51 [2019-10-01 22:58:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:35,449 INFO L225 Difference]: With dead ends: 68 [2019-10-01 22:58:35,449 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 22:58:35,450 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 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-10-01 22:58:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 22:58:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-01 22:58:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-01 22:58:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-10-01 22:58:35,452 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 51 [2019-10-01 22:58:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:35,453 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-10-01 22:58:35,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:58:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-10-01 22:58:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-01 22:58:35,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:35,454 INFO L411 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:35,454 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:35,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:35,454 INFO L82 PathProgramCache]: Analyzing trace with hash -518852626, now seen corresponding path program 39 times [2019-10-01 22:58:35,455 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:35,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:35,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:36,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:36,108 INFO L224 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-10-01 22:58:36,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:59:12,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-10-01 22:59:12,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:12,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 22:59:12,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:59:12,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:12,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 22:59:12,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:59:12,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:59:12,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:59:12,297 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 43 states. [2019-10-01 22:59:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:12,358 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-10-01 22:59:12,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:59:12,359 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 52 [2019-10-01 22:59:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:12,360 INFO L225 Difference]: With dead ends: 69 [2019-10-01 22:59:12,360 INFO L226 Difference]: Without dead ends: 58 [2019-10-01 22:59:12,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:59:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-01 22:59:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-01 22:59:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 22:59:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-10-01 22:59:12,363 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 52 [2019-10-01 22:59:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:12,364 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-10-01 22:59:12,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:59:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-10-01 22:59:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 22:59:12,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:12,365 INFO L411 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:12,365 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:12,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:12,366 INFO L82 PathProgramCache]: Analyzing trace with hash -995640910, now seen corresponding path program 40 times [2019-10-01 22:59:12,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:12,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:12,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:13,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:13,112 INFO L224 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-10-01 22:59:13,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:59:13,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:59:13,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:13,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 22:59:13,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:13,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:13,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 22:59:13,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 22:59:13,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 22:59:13,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:59:13,249 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 44 states. [2019-10-01 22:59:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:13,313 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-10-01 22:59:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:59:13,315 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 53 [2019-10-01 22:59:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:13,315 INFO L225 Difference]: With dead ends: 70 [2019-10-01 22:59:13,315 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 22:59:13,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:59:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 22:59:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-10-01 22:59:13,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 22:59:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-10-01 22:59:13,319 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2019-10-01 22:59:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:13,320 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-10-01 22:59:13,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 22:59:13,320 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-10-01 22:59:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 22:59:13,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:13,321 INFO L411 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:13,321 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1403791470, now seen corresponding path program 41 times [2019-10-01 22:59:13,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:13,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:13,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:13,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:13,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:14,080 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:14,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:14,080 INFO L224 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-10-01 22:59:14,130 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:59:15,052 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-10-01 22:59:15,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:15,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 22:59:15,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:15,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:15,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 22:59:15,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 22:59:15,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 22:59:15,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:59:15,102 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 45 states. [2019-10-01 22:59:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:15,189 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-10-01 22:59:15,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 22:59:15,194 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 54 [2019-10-01 22:59:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:15,195 INFO L225 Difference]: With dead ends: 71 [2019-10-01 22:59:15,195 INFO L226 Difference]: Without dead ends: 60 [2019-10-01 22:59:15,196 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:59:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-01 22:59:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-01 22:59:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-01 22:59:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-10-01 22:59:15,200 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2019-10-01 22:59:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:15,200 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-10-01 22:59:15,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 22:59:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-10-01 22:59:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 22:59:15,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:15,201 INFO L411 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:15,201 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:15,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1523216078, now seen corresponding path program 42 times [2019-10-01 22:59:15,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:15,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:15,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:15,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:16,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:16,171 INFO L224 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-10-01 22:59:16,228 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:59:52,054 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-10-01 22:59:52,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:52,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 22:59:52,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:52,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:52,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-10-01 22:59:52,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 22:59:52,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 22:59:52,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:59:52,113 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 46 states. [2019-10-01 22:59:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:52,196 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-10-01 22:59:52,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 22:59:52,200 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55 [2019-10-01 22:59:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:52,202 INFO L225 Difference]: With dead ends: 72 [2019-10-01 22:59:52,202 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 22:59:52,203 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:59:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 22:59:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-01 22:59:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 22:59:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-10-01 22:59:52,206 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2019-10-01 22:59:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:52,207 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-10-01 22:59:52,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 22:59:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-10-01 22:59:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 22:59:52,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:52,207 INFO L411 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:52,208 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:52,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2066136850, now seen corresponding path program 43 times [2019-10-01 22:59:52,208 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:52,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:52,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:52,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:52,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:53,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:53,048 INFO L224 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-10-01 22:59:53,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:59:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:53,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 22:59:53,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:53,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:53,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 22:59:53,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 22:59:53,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 22:59:53,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:59:53,178 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 47 states. [2019-10-01 22:59:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:53,252 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-10-01 22:59:53,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:59:53,252 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 56 [2019-10-01 22:59:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:53,255 INFO L225 Difference]: With dead ends: 73 [2019-10-01 22:59:53,255 INFO L226 Difference]: Without dead ends: 62 [2019-10-01 22:59:53,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:59:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-01 22:59:53,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-01 22:59:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 22:59:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-10-01 22:59:53,260 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 56 [2019-10-01 22:59:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:53,260 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-10-01 22:59:53,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 22:59:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-10-01 22:59:53,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 22:59:53,261 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:53,261 INFO L411 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:53,261 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1716811598, now seen corresponding path program 44 times [2019-10-01 22:59:53,262 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:53,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:53,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:59:53,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:54,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:54,082 INFO L224 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-10-01 22:59:54,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:59:54,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:59:54,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:54,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:59:54,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:54,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:54,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 22:59:54,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:59:54,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:59:54,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:59:54,210 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 48 states. [2019-10-01 22:59:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:54,281 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-10-01 22:59:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:59:54,282 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2019-10-01 22:59:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:54,283 INFO L225 Difference]: With dead ends: 74 [2019-10-01 22:59:54,283 INFO L226 Difference]: Without dead ends: 63 [2019-10-01 22:59:54,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 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-10-01 22:59:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-01 22:59:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-10-01 22:59:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:59:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-10-01 22:59:54,287 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 57 [2019-10-01 22:59:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:54,288 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-10-01 22:59:54,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:59:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-10-01 22:59:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-01 22:59:54,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:54,288 INFO L411 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:54,289 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:54,289 INFO L82 PathProgramCache]: Analyzing trace with hash 522336622, now seen corresponding path program 45 times [2019-10-01 22:59:54,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:54,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:54,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:59:55,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:55,117 INFO L224 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-10-01 22:59:55,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:00:30,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-01 23:00:30,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:30,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 23:00:30,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:00:30,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:30,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-01 23:00:30,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 23:00:30,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 23:00:30,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:00:30,884 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 49 states. [2019-10-01 23:00:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:30,983 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-10-01 23:00:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 23:00:30,983 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 58 [2019-10-01 23:00:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:30,984 INFO L225 Difference]: With dead ends: 75 [2019-10-01 23:00:30,984 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 23:00:30,985 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:00:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 23:00:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-01 23:00:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-01 23:00:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-10-01 23:00:30,989 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 58 [2019-10-01 23:00:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:30,989 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-10-01 23:00:30,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 23:00:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-10-01 23:00:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-01 23:00:30,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:30,990 INFO L411 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:30,990 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1216454706, now seen corresponding path program 46 times [2019-10-01 23:00:30,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:30,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:30,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:30,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:30,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:00:31,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:31,852 INFO L224 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-10-01 23:00:31,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:00:31,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:00:31,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:31,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 23:00:31,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:00:31,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:31,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 23:00:31,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 23:00:31,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 23:00:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 23:00:31,983 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 50 states. [2019-10-01 23:00:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:32,061 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-10-01 23:00:32,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 23:00:32,062 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 59 [2019-10-01 23:00:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:32,063 INFO L225 Difference]: With dead ends: 76 [2019-10-01 23:00:32,063 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 23:00:32,064 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 23:00:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 23:00:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-10-01 23:00:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-01 23:00:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-10-01 23:00:32,068 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2019-10-01 23:00:32,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:32,068 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-10-01 23:00:32,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 23:00:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-10-01 23:00:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-01 23:00:32,069 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:32,069 INFO L411 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:32,069 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:32,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1259278830, now seen corresponding path program 47 times [2019-10-01 23:00:32,070 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:32,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:32,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:00:33,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:33,467 INFO L224 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-10-01 23:00:33,533 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:00:44,246 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-10-01 23:00:44,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:44,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 23:00:44,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:00:44,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:44,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-01 23:00:44,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 23:00:44,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 23:00:44,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 23:00:44,289 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 51 states. [2019-10-01 23:00:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:44,380 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-10-01 23:00:44,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 23:00:44,380 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 60 [2019-10-01 23:00:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:44,381 INFO L225 Difference]: With dead ends: 77 [2019-10-01 23:00:44,381 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 23:00:44,382 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 23:00:44,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 23:00:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-01 23:00:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-01 23:00:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-10-01 23:00:44,385 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2019-10-01 23:00:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:44,385 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-10-01 23:00:44,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 23:00:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-10-01 23:00:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-01 23:00:44,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:44,386 INFO L411 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:44,386 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:44,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:44,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1708140622, now seen corresponding path program 48 times [2019-10-01 23:00:44,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:44,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:44,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:44,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:44,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:00:45,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:45,589 INFO L224 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-10-01 23:00:45,659 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:02:09,485 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 23:02:09,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:02:09,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-01 23:02:09,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:02:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:02:09,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:02:09,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-10-01 23:02:09,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 23:02:09,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 23:02:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 23:02:09,577 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 52 states. [2019-10-01 23:02:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:02:09,675 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-10-01 23:02:09,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 23:02:09,676 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 61 [2019-10-01 23:02:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:02:09,677 INFO L225 Difference]: With dead ends: 78 [2019-10-01 23:02:09,677 INFO L226 Difference]: Without dead ends: 67 [2019-10-01 23:02:09,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 23:02:09,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-01 23:02:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-10-01 23:02:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 23:02:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-10-01 23:02:09,681 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 61 [2019-10-01 23:02:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:02:09,681 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-10-01 23:02:09,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 23:02:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-10-01 23:02:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-01 23:02:09,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:02:09,682 INFO L411 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:02:09,683 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:02:09,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:02:09,683 INFO L82 PathProgramCache]: Analyzing trace with hash 791136878, now seen corresponding path program 49 times [2019-10-01 23:02:09,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:02:09,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:02:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:09,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:02:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:02:10,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:02:10,964 INFO L224 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-10-01 23:02:11,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:02:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:11,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 23:02:11,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:02:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:02:11,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:02:11,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 23:02:11,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 23:02:11,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 23:02:11,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:02:11,124 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 53 states. [2019-10-01 23:02:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:02:11,230 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-10-01 23:02:11,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 23:02:11,232 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 62 [2019-10-01 23:02:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:02:11,233 INFO L225 Difference]: With dead ends: 79 [2019-10-01 23:02:11,233 INFO L226 Difference]: Without dead ends: 68 [2019-10-01 23:02:11,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:02:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-01 23:02:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-01 23:02:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 23:02:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-10-01 23:02:11,238 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 62 [2019-10-01 23:02:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:02:11,238 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-10-01 23:02:11,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 23:02:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-10-01 23:02:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 23:02:11,240 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:02:11,240 INFO L411 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:02:11,241 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:02:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:02:11,241 INFO L82 PathProgramCache]: Analyzing trace with hash 959328050, now seen corresponding path program 50 times [2019-10-01 23:02:11,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:02:11,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:02:11,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:11,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:02:11,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:02:12,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:02:12,560 INFO L224 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-10-01 23:02:12,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:02:12,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:02:12,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:02:12,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 23:02:12,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:02:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:02:12,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:02:12,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 23:02:12,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 23:02:12,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 23:02:12,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 23:02:12,704 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 54 states. [2019-10-01 23:02:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:02:12,808 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2019-10-01 23:02:12,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 23:02:12,809 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 63 [2019-10-01 23:02:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:02:12,811 INFO L225 Difference]: With dead ends: 80 [2019-10-01 23:02:12,814 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 23:02:12,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 23:02:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 23:02:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-10-01 23:02:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 23:02:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-10-01 23:02:12,818 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 63 [2019-10-01 23:02:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:02:12,819 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-10-01 23:02:12,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 23:02:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-10-01 23:02:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 23:02:12,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:02:12,819 INFO L411 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:02:12,820 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:02:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:02:12,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1878287086, now seen corresponding path program 51 times [2019-10-01 23:02:12,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:02:12,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:02:12,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:12,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:02:12,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:02:13,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:02:13,971 INFO L224 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-10-01 23:02:14,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:03:25,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-10-01 23:03:25,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:03:25,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 23:03:25,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:03:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:03:25,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:03:25,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-01 23:03:25,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 23:03:25,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 23:03:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 23:03:25,316 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 55 states. [2019-10-01 23:03:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:03:25,435 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-10-01 23:03:25,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 23:03:25,436 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 64 [2019-10-01 23:03:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:03:25,437 INFO L225 Difference]: With dead ends: 81 [2019-10-01 23:03:25,437 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 23:03:25,437 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 23:03:25,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 23:03:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-01 23:03:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-01 23:03:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-10-01 23:03:25,439 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 64 [2019-10-01 23:03:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:03:25,440 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-10-01 23:03:25,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 23:03:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-10-01 23:03:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 23:03:25,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:03:25,441 INFO L411 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:03:25,441 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:03:25,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:03:25,441 INFO L82 PathProgramCache]: Analyzing trace with hash 301246130, now seen corresponding path program 52 times [2019-10-01 23:03:25,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:03:25,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:03:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:25,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:03:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:03:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:03:26,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:03:26,717 INFO L224 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-10-01 23:03:26,804 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:03:26,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:03:26,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:03:26,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 23:03:26,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:03:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:03:26,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:03:26,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 23:03:26,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 23:03:26,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 23:03:26,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 23:03:26,875 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 56 states. [2019-10-01 23:03:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:03:26,986 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-10-01 23:03:26,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 23:03:26,987 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 65 [2019-10-01 23:03:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:03:26,988 INFO L225 Difference]: With dead ends: 82 [2019-10-01 23:03:26,988 INFO L226 Difference]: Without dead ends: 71 [2019-10-01 23:03:26,989 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 23:03:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-01 23:03:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-10-01 23:03:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 23:03:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-10-01 23:03:26,992 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 65 [2019-10-01 23:03:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:03:26,992 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-10-01 23:03:26,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 23:03:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-10-01 23:03:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-01 23:03:26,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:03:26,993 INFO L411 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:03:26,994 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:03:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:03:26,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1342383250, now seen corresponding path program 53 times [2019-10-01 23:03:26,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:03:26,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:03:26,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:26,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:03:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:03:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:03:28,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:03:28,117 INFO L224 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-10-01 23:03:28,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:03:55,514 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-10-01 23:03:55,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:03:55,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 23:03:55,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:03:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:03:55,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:03:55,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-01 23:03:55,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 23:03:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 23:03:55,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 23:03:55,579 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 57 states. [2019-10-01 23:03:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:03:55,682 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2019-10-01 23:03:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 23:03:55,683 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 66 [2019-10-01 23:03:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:03:55,683 INFO L225 Difference]: With dead ends: 83 [2019-10-01 23:03:55,683 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 23:03:55,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 66 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-10-01 23:03:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 23:03:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-01 23:03:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-01 23:03:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-10-01 23:03:55,686 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 66 [2019-10-01 23:03:55,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:03:55,687 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-10-01 23:03:55,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 23:03:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-10-01 23:03:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 23:03:55,688 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:03:55,688 INFO L411 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:03:55,688 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:03:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:03:55,688 INFO L82 PathProgramCache]: Analyzing trace with hash -755286478, now seen corresponding path program 54 times [2019-10-01 23:03:55,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:03:55,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:03:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:55,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:03:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:03:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:03:57,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:03:57,305 INFO L224 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-10-01 23:03:57,387 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:05:44,392 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-10-01 23:05:44,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:05:44,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 23:05:44,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:05:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:05:44,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:05:44,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-10-01 23:05:44,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 23:05:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 23:05:44,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 23:05:44,493 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 58 states. [2019-10-01 23:05:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:05:44,612 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-10-01 23:05:44,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 23:05:44,612 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 67 [2019-10-01 23:05:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:05:44,613 INFO L225 Difference]: With dead ends: 84 [2019-10-01 23:05:44,613 INFO L226 Difference]: Without dead ends: 73 [2019-10-01 23:05:44,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 23:05:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-01 23:05:44,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-01 23:05:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-01 23:05:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-10-01 23:05:44,618 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 67 [2019-10-01 23:05:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:05:44,618 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-10-01 23:05:44,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 23:05:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-10-01 23:05:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 23:05:44,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:05:44,619 INFO L411 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:05:44,619 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:05:44,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:05:44,619 INFO L82 PathProgramCache]: Analyzing trace with hash 264844270, now seen corresponding path program 55 times [2019-10-01 23:05:44,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:05:44,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:05:44,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:44,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:05:44,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:05:46,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:05:46,103 INFO L224 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-10-01 23:05:46,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:05:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:46,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 23:05:46,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:05:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (56)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:05:46,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:05:46,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-01 23:05:46,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 23:05:46,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 23:05:46,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:05:46,261 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 59 states. [2019-10-01 23:05:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:05:46,340 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-10-01 23:05:46,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 23:05:46,342 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 68 [2019-10-01 23:05:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:05:46,343 INFO L225 Difference]: With dead ends: 85 [2019-10-01 23:05:46,343 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 23:05:46,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:05:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 23:05:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-01 23:05:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-01 23:05:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-10-01 23:05:46,347 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 68 [2019-10-01 23:05:46,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:05:46,347 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-10-01 23:05:46,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 23:05:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-10-01 23:05:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-01 23:05:46,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:05:46,348 INFO L411 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:05:46,348 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:05:46,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:05:46,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1824126386, now seen corresponding path program 56 times [2019-10-01 23:05:46,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:05:46,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:05:46,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:46,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:05:46,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:05:47,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:05:47,774 INFO L224 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-10-01 23:05:47,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:05:47,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:05:47,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:05:47,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 23:05:47,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:05:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:05:47,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:05:47,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 23:05:47,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 23:05:47,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 23:05:47,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 23:05:47,926 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 60 states. [2019-10-01 23:05:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:05:48,036 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-10-01 23:05:48,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 23:05:48,038 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 69 [2019-10-01 23:05:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:05:48,039 INFO L225 Difference]: With dead ends: 86 [2019-10-01 23:05:48,039 INFO L226 Difference]: Without dead ends: 75 [2019-10-01 23:05:48,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 23:05:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-01 23:05:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-01 23:05:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 23:05:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-10-01 23:05:48,044 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 69 [2019-10-01 23:05:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:05:48,044 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-10-01 23:05:48,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 23:05:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-10-01 23:05:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 23:05:48,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:05:48,045 INFO L411 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:05:48,046 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:05:48,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:05:48,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1377735570, now seen corresponding path program 57 times [2019-10-01 23:05:48,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:05:48,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:05:48,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:48,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:05:48,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:05:49,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:05:49,506 INFO L224 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-10-01 23:05:49,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:07:26,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-10-01 23:07:26,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:26,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 23:07:26,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:07:26,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:26,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 23:07:26,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 23:07:26,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 23:07:26,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 23:07:26,260 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 61 states. [2019-10-01 23:07:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:26,374 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-10-01 23:07:26,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 23:07:26,375 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 70 [2019-10-01 23:07:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:26,375 INFO L225 Difference]: With dead ends: 87 [2019-10-01 23:07:26,375 INFO L226 Difference]: Without dead ends: 76 [2019-10-01 23:07:26,376 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 23:07:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-01 23:07:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-01 23:07:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-01 23:07:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-10-01 23:07:26,379 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 70 [2019-10-01 23:07:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:26,379 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-10-01 23:07:26,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 23:07:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-10-01 23:07:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-01 23:07:26,380 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:26,380 INFO L411 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:26,380 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:26,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1851208398, now seen corresponding path program 58 times [2019-10-01 23:07:26,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:26,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:26,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:26,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:26,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:07:27,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:27,782 INFO L224 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-10-01 23:07:27,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:07:27,923 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:07:27,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:27,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 23:07:27,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (59)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:07:27,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:27,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-10-01 23:07:27,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 23:07:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 23:07:27,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 23:07:27,951 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 62 states. [2019-10-01 23:07:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:28,034 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-10-01 23:07:28,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 23:07:28,035 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 71 [2019-10-01 23:07:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:28,036 INFO L225 Difference]: With dead ends: 88 [2019-10-01 23:07:28,036 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 23:07:28,036 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 23:07:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 23:07:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-01 23:07:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 23:07:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-10-01 23:07:28,041 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 71 [2019-10-01 23:07:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:28,041 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-10-01 23:07:28,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 23:07:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-10-01 23:07:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 23:07:28,042 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:28,042 INFO L411 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:28,042 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash 651003118, now seen corresponding path program 59 times [2019-10-01 23:07:28,043 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:28,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:28,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:28,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:07:29,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:29,466 INFO L224 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-10-01 23:07:29,561 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:07:49,978 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-10-01 23:07:49,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:49,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-01 23:07:49,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:07:50,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:50,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-10-01 23:07:50,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-01 23:07:50,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-01 23:07:50,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 23:07:50,033 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 63 states. [2019-10-01 23:07:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:50,158 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2019-10-01 23:07:50,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 23:07:50,159 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 72 [2019-10-01 23:07:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:50,160 INFO L225 Difference]: With dead ends: 89 [2019-10-01 23:07:50,160 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 23:07:50,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 23:07:50,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 23:07:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-01 23:07:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-01 23:07:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-10-01 23:07:50,164 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 72 [2019-10-01 23:07:50,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:50,165 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-10-01 23:07:50,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-01 23:07:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-10-01 23:07:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-01 23:07:50,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:50,166 INFO L411 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:50,166 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:50,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:50,167 INFO L82 PathProgramCache]: Analyzing trace with hash 910148786, now seen corresponding path program 60 times [2019-10-01 23:07:50,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:50,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:50,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:50,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:07:51,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:51,594 INFO L224 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-10-01 23:07:51,692 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:10:19,223 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-10-01 23:10:19,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:10:19,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-01 23:10:19,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:10:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:10:19,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:10:19,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-10-01 23:10:19,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-01 23:10:19,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-01 23:10:19,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 23:10:19,340 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 64 states. [2019-10-01 23:10:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:10:19,434 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-10-01 23:10:19,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-01 23:10:19,435 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 73 [2019-10-01 23:10:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:10:19,435 INFO L225 Difference]: With dead ends: 90 [2019-10-01 23:10:19,435 INFO L226 Difference]: Without dead ends: 79 [2019-10-01 23:10:19,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 23:10:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-01 23:10:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-10-01 23:10:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-01 23:10:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-10-01 23:10:19,440 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 73 [2019-10-01 23:10:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:10:19,441 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-10-01 23:10:19,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-01 23:10:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-10-01 23:10:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-01 23:10:19,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:10:19,442 INFO L411 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:10:19,442 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:10:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:10:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash 353729902, now seen corresponding path program 61 times [2019-10-01 23:10:19,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:10:19,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:10:19,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:19,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:10:19,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:10:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:10:20,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:10:20,878 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:10:20,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:10:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:10:21,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-01 23:10:21,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:10:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:10:21,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:10:21,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-10-01 23:10:21,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 23:10:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 23:10:21,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 23:10:21,052 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 65 states. [2019-10-01 23:10:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:10:21,195 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-10-01 23:10:21,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 23:10:21,196 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 74 [2019-10-01 23:10:21,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:10:21,196 INFO L225 Difference]: With dead ends: 91 [2019-10-01 23:10:21,196 INFO L226 Difference]: Without dead ends: 80 [2019-10-01 23:10:21,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 23:10:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-01 23:10:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-01 23:10:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-01 23:10:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-10-01 23:10:21,200 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2019-10-01 23:10:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:10:21,200 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-10-01 23:10:21,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 23:10:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-10-01 23:10:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 23:10:21,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:10:21,203 INFO L411 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:10:21,203 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:10:21,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:10:21,203 INFO L82 PathProgramCache]: Analyzing trace with hash 284613682, now seen corresponding path program 62 times [2019-10-01 23:10:21,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:10:21,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:10:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:21,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:10:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:10:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:10:22,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:10:22,781 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:10:22,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:10:22,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:10:22,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:10:22,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-01 23:10:22,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:10:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:10:22,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:10:22,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-10-01 23:10:22,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 23:10:22,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 23:10:22,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 23:10:22,948 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 66 states. [2019-10-01 23:10:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:10:23,086 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-10-01 23:10:23,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 23:10:23,088 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 75 [2019-10-01 23:10:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:10:23,089 INFO L225 Difference]: With dead ends: 92 [2019-10-01 23:10:23,089 INFO L226 Difference]: Without dead ends: 81 [2019-10-01 23:10:23,090 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 23:10:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-01 23:10:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-01 23:10:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 23:10:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-10-01 23:10:23,094 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2019-10-01 23:10:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:10:23,094 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-10-01 23:10:23,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 23:10:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-10-01 23:10:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 23:10:23,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:10:23,095 INFO L411 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:10:23,096 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:10:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:10:23,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1857989138, now seen corresponding path program 63 times [2019-10-01 23:10:23,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:10:23,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:10:23,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:23,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:10:23,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:10:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:10:24,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:10:24,765 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:10:24,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2