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/sorting_bubblesort_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:28:41,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:28:41,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:28:41,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:28:41,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:28:41,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:28:41,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:28:41,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:28:41,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:28:41,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:28:41,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:28:41,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:28:41,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:28:41,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:28:41,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:28:41,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:28:41,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:28:41,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:28:41,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:28:41,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:28:41,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:28:41,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:28:41,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:28:41,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:28:41,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:28:41,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:28:41,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:28:41,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:28:41,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:28:41,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:28:41,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:28:41,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:28:41,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:28:41,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:28:41,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:28:41,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:28:41,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:28:41,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:28:41,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:28:41,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:28:41,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:28:41,374 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:28:41,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:28:41,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:28:41,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:28:41,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:28:41,395 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:28:41,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:28:41,396 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:28:41,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:28:41,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:28:41,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:28:41,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:28:41,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:28:41,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:28:41,398 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:28:41,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:28:41,398 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:28:41,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:28:41,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:28:41,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:28:41,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:28:41,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:28:41,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:28:41,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:28:41,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:28:41,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:28:41,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:28:41,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:28:41,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:28:41,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:28:41,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:28:41,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:28:41,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:28:41,477 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:28:41,477 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:28:41,478 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-1.i [2019-10-01 22:28:41,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62f43fdc/20be55640f85441db95c5385087fbdb6/FLAG3a8d6c6dc [2019-10-01 22:28:41,990 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:28:41,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-1.i [2019-10-01 22:28:41,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62f43fdc/20be55640f85441db95c5385087fbdb6/FLAG3a8d6c6dc [2019-10-01 22:28:42,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62f43fdc/20be55640f85441db95c5385087fbdb6 [2019-10-01 22:28:42,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:28:42,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:28:42,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:28:42,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:28:42,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:28:42,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:28:42" (1/1) ... [2019-10-01 22:28:42,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ea241b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42, skipping insertion in model container [2019-10-01 22:28:42,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:28:42" (1/1) ... [2019-10-01 22:28:42,416 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:28:42,433 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:28:42,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:28:42,624 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:28:42,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:28:42,751 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:28:42,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42 WrapperNode [2019-10-01 22:28:42,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:28:42,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:28:42,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:28:42,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:28:42,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42" (1/1) ... [2019-10-01 22:28:42,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42" (1/1) ... [2019-10-01 22:28:42,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42" (1/1) ... [2019-10-01 22:28:42,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42" (1/1) ... [2019-10-01 22:28:42,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42" (1/1) ... [2019-10-01 22:28:42,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42" (1/1) ... [2019-10-01 22:28:42,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42" (1/1) ... [2019-10-01 22:28:42,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:28:42,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:28:42,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:28:42,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:28:42,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42" (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:28:42,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:28:42,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:28:42,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:28:42,860 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:28:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:28:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:28:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:28:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:28:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:28:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:28:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:28:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:28:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:28:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:28:43,141 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:28:43,141 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-01 22:28:43,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:28:43 BoogieIcfgContainer [2019-10-01 22:28:43,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:28:43,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:28:43,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:28:43,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:28:43,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:28:42" (1/3) ... [2019-10-01 22:28:43,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d39d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:28:43, skipping insertion in model container [2019-10-01 22:28:43,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:42" (2/3) ... [2019-10-01 22:28:43,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d39d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:28:43, skipping insertion in model container [2019-10-01 22:28:43,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:28:43" (3/3) ... [2019-10-01 22:28:43,171 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_ground-1.i [2019-10-01 22:28:43,189 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:28:43,196 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:28:43,225 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:28:43,255 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:28:43,255 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:28:43,256 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:28:43,256 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:28:43,256 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:28:43,256 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:28:43,256 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:28:43,256 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:28:43,257 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:28:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 22:28:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:28:43,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:43,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:43,282 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:43,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:43,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1296691801, now seen corresponding path program 1 times [2019-10-01 22:28:43,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:43,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:43,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:43,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:43,423 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:28:43,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:43,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:28:43,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:28:43,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:28:43,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:28:43,449 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 22:28:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:43,476 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-10-01 22:28:43,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:28:43,478 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-01 22:28:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:43,487 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:28:43,488 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:28:43,491 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:28:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:28:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:28:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:28:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-10-01 22:28:43,535 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2019-10-01 22:28:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:43,535 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-10-01 22:28:43,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:28:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-10-01 22:28:43,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:28:43,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:43,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:43,538 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:43,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:43,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1547542812, now seen corresponding path program 1 times [2019-10-01 22:28:43,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:43,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:43,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:43,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:43,645 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:28:43,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:43,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:43,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:43,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:43,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:43,648 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-10-01 22:28:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:43,678 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 22:28:43,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:43,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-01 22:28:43,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:43,680 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:28:43,680 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:28:43,681 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:28:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:28:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 22:28:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:28:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-01 22:28:43,688 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2019-10-01 22:28:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:43,688 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-01 22:28:43,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-10-01 22:28:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-01 22:28:43,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:43,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:43,690 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1387426810, now seen corresponding path program 1 times [2019-10-01 22:28:43,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:43,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:43,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:43,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:43,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:43,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:43,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:43,748 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-10-01 22:28:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:43,768 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-10-01 22:28:43,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:43,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-01 22:28:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:43,770 INFO L225 Difference]: With dead ends: 44 [2019-10-01 22:28:43,770 INFO L226 Difference]: Without dead ends: 31 [2019-10-01 22:28:43,771 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:28:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-01 22:28:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-01 22:28:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:28:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-10-01 22:28:43,778 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2019-10-01 22:28:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:43,778 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-01 22:28:43,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-10-01 22:28:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 22:28:43,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:43,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:43,780 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:43,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:43,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1108929549, now seen corresponding path program 1 times [2019-10-01 22:28:43,781 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:43,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:43,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:43,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:43,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:43,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:43,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:43,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:43,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:43,852 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 3 states. [2019-10-01 22:28:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:43,874 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-10-01 22:28:43,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:43,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-01 22:28:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:43,876 INFO L225 Difference]: With dead ends: 56 [2019-10-01 22:28:43,876 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 22:28:43,877 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:28:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 22:28:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-10-01 22:28:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:28:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-10-01 22:28:43,884 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 20 [2019-10-01 22:28:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:43,884 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-10-01 22:28:43,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-10-01 22:28:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 22:28:43,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:43,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:43,886 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:43,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2055572838, now seen corresponding path program 1 times [2019-10-01 22:28:43,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:43,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:43,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:43,934 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:43,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:44,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:28:44,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:44,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:44,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:28:44,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:28:44,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:28:44,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:28:44,058 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 5 states. [2019-10-01 22:28:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:44,089 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-10-01 22:28:44,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:28:44,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-01 22:28:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:44,091 INFO L225 Difference]: With dead ends: 58 [2019-10-01 22:28:44,091 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 22:28:44,092 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:28:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 22:28:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-01 22:28:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-01 22:28:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-01 22:28:44,098 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 23 [2019-10-01 22:28:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:44,098 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-01 22:28:44,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:28:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-01 22:28:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 22:28:44,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:44,100 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:44,100 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash 442145592, now seen corresponding path program 2 times [2019-10-01 22:28:44,101 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:44,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:44,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:44,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:44,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:44,199 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:28:44,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:44,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:44,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:44,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:28:44,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:44,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:44,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:28:44,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:28:44,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:28:44,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:28:44,282 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2019-10-01 22:28:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:44,329 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-10-01 22:28:44,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:28:44,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-01 22:28:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:44,334 INFO L225 Difference]: With dead ends: 60 [2019-10-01 22:28:44,334 INFO L226 Difference]: Without dead ends: 37 [2019-10-01 22:28:44,336 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:28:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-01 22:28:44,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-10-01 22:28:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 22:28:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-10-01 22:28:44,350 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 25 [2019-10-01 22:28:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:44,350 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-10-01 22:28:44,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:28:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-10-01 22:28:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:28:44,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:44,353 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:44,354 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:44,359 INFO L82 PathProgramCache]: Analyzing trace with hash -137161642, now seen corresponding path program 3 times [2019-10-01 22:28:44,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:44,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:44,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:44,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:44,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:44,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:28:44,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:44,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:28:44,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:28:44,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:44,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 22:28:44,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:28:44,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:28:44,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:44,578 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 8 states. [2019-10-01 22:28:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:44,643 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2019-10-01 22:28:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:28:44,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-10-01 22:28:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:44,644 INFO L225 Difference]: With dead ends: 71 [2019-10-01 22:28:44,645 INFO L226 Difference]: Without dead ends: 48 [2019-10-01 22:28:44,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-01 22:28:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2019-10-01 22:28:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:28:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-10-01 22:28:44,652 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2019-10-01 22:28:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:44,652 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-10-01 22:28:44,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:28:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-10-01 22:28:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:28:44,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:44,654 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:44,654 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:44,655 INFO L82 PathProgramCache]: Analyzing trace with hash -890436781, now seen corresponding path program 4 times [2019-10-01 22:28:44,655 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:44,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:44,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:28:44,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:44,722 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:28:44,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:28:44,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:44,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:44,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:28:44,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:28:44,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:44,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:28:44,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:28:44,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:28:44,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:44,806 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 8 states. [2019-10-01 22:28:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:44,848 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2019-10-01 22:28:44,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:28:44,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-10-01 22:28:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:44,849 INFO L225 Difference]: With dead ends: 74 [2019-10-01 22:28:44,849 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 22:28:44,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 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:28:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 22:28:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-10-01 22:28:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-01 22:28:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2019-10-01 22:28:44,856 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 32 [2019-10-01 22:28:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:44,857 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2019-10-01 22:28:44,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:28:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2019-10-01 22:28:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:28:44,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:44,858 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:44,858 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash -250762123, now seen corresponding path program 5 times [2019-10-01 22:28:44,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:44,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:44,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:44,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:28:44,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:44,940 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) [2019-10-01 22:28:44,966 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:44,995 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-01 22:28:44,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:44,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:28:44,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 22:28:45,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:45,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 22:28:45,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:28:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:28:45,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:45,040 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 11 states. [2019-10-01 22:28:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:45,120 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2019-10-01 22:28:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:28:45,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-10-01 22:28:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:45,121 INFO L225 Difference]: With dead ends: 86 [2019-10-01 22:28:45,121 INFO L226 Difference]: Without dead ends: 58 [2019-10-01 22:28:45,122 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-01 22:28:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2019-10-01 22:28:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-01 22:28:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-10-01 22:28:45,128 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 34 [2019-10-01 22:28:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:45,130 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-10-01 22:28:45,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:28:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-10-01 22:28:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 22:28:45,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:45,132 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:45,132 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:45,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:45,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1537034928, now seen corresponding path program 6 times [2019-10-01 22:28:45,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:45,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:45,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:45,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 22:28:45,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:45,277 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:28:45,306 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:28:45,350 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:28:45,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:45,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:28:45,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:28:45,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:45,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-01 22:28:45,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:28:45,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:28:45,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:28:45,423 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 13 states. [2019-10-01 22:28:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:45,513 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2019-10-01 22:28:45,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:28:45,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-10-01 22:28:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:45,514 INFO L225 Difference]: With dead ends: 100 [2019-10-01 22:28:45,515 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 22:28:45,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:28:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 22:28:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2019-10-01 22:28:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 22:28:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2019-10-01 22:28:45,523 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 39 [2019-10-01 22:28:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:45,523 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2019-10-01 22:28:45,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:28:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2019-10-01 22:28:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:28:45,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:45,525 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:45,525 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:45,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash 747611417, now seen corresponding path program 7 times [2019-10-01 22:28:45,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:45,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:45,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:45,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:45,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:45,635 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:28:45,657 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:28:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:45,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:28:45,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:45,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:45,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:28:45,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:28:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:28:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:45,724 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 11 states. [2019-10-01 22:28:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:45,764 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2019-10-01 22:28:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:28:45,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-10-01 22:28:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:45,765 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:28:45,765 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 22:28:45,766 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 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:28:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 22:28:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-10-01 22:28:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:28:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-10-01 22:28:45,772 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 44 [2019-10-01 22:28:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:45,773 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-10-01 22:28:45,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:28:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-10-01 22:28:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 22:28:45,774 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:45,774 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:45,774 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:45,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:45,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1331800891, now seen corresponding path program 8 times [2019-10-01 22:28:45,775 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:45,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:45,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:45,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:45,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:45,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:45,873 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) [2019-10-01 22:28:45,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:45,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:45,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:45,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:28:45,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:45,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:45,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:28:45,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:28:45,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:28:45,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:28:45,990 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 12 states. [2019-10-01 22:28:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:46,042 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2019-10-01 22:28:46,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:28:46,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-10-01 22:28:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:46,044 INFO L225 Difference]: With dead ends: 106 [2019-10-01 22:28:46,044 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 22:28:46,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 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:28:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 22:28:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-10-01 22:28:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-01 22:28:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-10-01 22:28:46,067 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 46 [2019-10-01 22:28:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:46,067 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-10-01 22:28:46,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:28:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-10-01 22:28:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-01 22:28:46,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:46,070 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:46,070 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:46,070 INFO L82 PathProgramCache]: Analyzing trace with hash 97169629, now seen corresponding path program 9 times [2019-10-01 22:28:46,070 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:46,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:46,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:46,236 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:28:46,264 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:28:46,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 22:28:46,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:46,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:28:46,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:46,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:46,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 22:28:46,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:46,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:46,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:46,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-01 22:28:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-01 22:28:46,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:46,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-10-01 22:28:46,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:28:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:28:46,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:46,579 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 22 states. [2019-10-01 22:28:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:47,256 INFO L93 Difference]: Finished difference Result 124 states and 153 transitions. [2019-10-01 22:28:47,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:28:47,256 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-10-01 22:28:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:47,259 INFO L225 Difference]: With dead ends: 124 [2019-10-01 22:28:47,259 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 22:28:47,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=1147, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:28:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 22:28:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-10-01 22:28:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-01 22:28:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-10-01 22:28:47,272 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 48 [2019-10-01 22:28:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:47,272 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-10-01 22:28:47,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:28:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-10-01 22:28:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-01 22:28:47,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,274 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,274 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1531389518, now seen corresponding path program 1 times [2019-10-01 22:28:47,274 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:47,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-01 22:28:47,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:47,335 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:28:47,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:28:47,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-01 22:28:47,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:47,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2019-10-01 22:28:47,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:28:47,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:28:47,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:28:47,549 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 18 states. [2019-10-01 22:28:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:47,630 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2019-10-01 22:28:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:28:47,631 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2019-10-01 22:28:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:47,634 INFO L225 Difference]: With dead ends: 134 [2019-10-01 22:28:47,634 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 22:28:47,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:28:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 22:28:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2019-10-01 22:28:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-01 22:28:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2019-10-01 22:28:47,642 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 58 [2019-10-01 22:28:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:47,642 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-10-01 22:28:47,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:28:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2019-10-01 22:28:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 22:28:47,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,644 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,644 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,644 INFO L82 PathProgramCache]: Analyzing trace with hash -193251271, now seen corresponding path program 2 times [2019-10-01 22:28:47,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:47,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 22:28:47,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:47,713 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:47,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:47,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:47,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:47,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:28:47,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-01 22:28:47,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:47,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2019-10-01 22:28:47,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:28:47,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:28:47,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:28:47,926 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 20 states. [2019-10-01 22:28:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:48,029 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2019-10-01 22:28:48,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:28:48,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2019-10-01 22:28:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:48,030 INFO L225 Difference]: With dead ends: 148 [2019-10-01 22:28:48,031 INFO L226 Difference]: Without dead ends: 95 [2019-10-01 22:28:48,031 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:28:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-01 22:28:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-10-01 22:28:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-01 22:28:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2019-10-01 22:28:48,038 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 63 [2019-10-01 22:28:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:48,039 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2019-10-01 22:28:48,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:28:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2019-10-01 22:28:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 22:28:48,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:48,040 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:48,040 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:48,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:48,041 INFO L82 PathProgramCache]: Analyzing trace with hash -606693674, now seen corresponding path program 3 times [2019-10-01 22:28:48,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:48,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 144 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-01 22:28:48,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:48,176 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:28:48,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:48,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 22:28:48,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:48,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:28:48,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:48,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:48,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2019-10-01 22:28:48,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:48,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:48,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:48,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:3 [2019-10-01 22:28:48,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-10-01 22:28:48,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:48,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2019-10-01 22:28:48,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 22:28:48,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 22:28:48,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:28:48,799 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 32 states. [2019-10-01 22:29:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:08,348 INFO L93 Difference]: Finished difference Result 187 states and 230 transitions. [2019-10-01 22:29:08,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:29:08,349 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-10-01 22:29:08,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:08,351 INFO L225 Difference]: With dead ends: 187 [2019-10-01 22:29:08,351 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 22:29:08,354 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=491, Invalid=3169, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:29:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 22:29:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100. [2019-10-01 22:29:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-01 22:29:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2019-10-01 22:29:08,363 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 68 [2019-10-01 22:29:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:08,363 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2019-10-01 22:29:08,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 22:29:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2019-10-01 22:29:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-01 22:29:08,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:08,365 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:08,365 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:08,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1776234069, now seen corresponding path program 4 times [2019-10-01 22:29:08,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:08,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:08,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:08,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:08,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 4 proven. 169 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:29:08,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:08,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 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:29:08,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:08,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:08,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:08,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:29:08,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-01 22:29:08,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:08,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:29:08,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:29:08,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:29:08,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:29:08,629 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand 17 states. [2019-10-01 22:29:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:08,690 INFO L93 Difference]: Finished difference Result 170 states and 202 transitions. [2019-10-01 22:29:08,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:29:08,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2019-10-01 22:29:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:08,692 INFO L225 Difference]: With dead ends: 170 [2019-10-01 22:29:08,692 INFO L226 Difference]: Without dead ends: 103 [2019-10-01 22:29:08,694 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 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:29:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-01 22:29:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-10-01 22:29:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 22:29:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2019-10-01 22:29:08,701 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 78 [2019-10-01 22:29:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:08,702 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2019-10-01 22:29:08,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:29:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2019-10-01 22:29:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-01 22:29:08,709 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:08,709 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:08,710 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1102761805, now seen corresponding path program 5 times [2019-10-01 22:29:08,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:08,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:08,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:08,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 4 proven. 196 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:29:08,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:08,909 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:08,952 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:09,314 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-10-01 22:29:09,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:09,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:29:09,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-10-01 22:29:09,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:09,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 24 [2019-10-01 22:29:09,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:29:09,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:29:09,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:29:09,409 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 24 states. [2019-10-01 22:29:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:09,529 INFO L93 Difference]: Finished difference Result 182 states and 220 transitions. [2019-10-01 22:29:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:29:09,530 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 80 [2019-10-01 22:29:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:09,532 INFO L225 Difference]: With dead ends: 182 [2019-10-01 22:29:09,532 INFO L226 Difference]: Without dead ends: 115 [2019-10-01 22:29:09,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:29:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-01 22:29:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2019-10-01 22:29:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-01 22:29:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2019-10-01 22:29:09,541 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 80 [2019-10-01 22:29:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:09,542 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2019-10-01 22:29:09,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:29:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2019-10-01 22:29:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-01 22:29:09,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:09,543 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:09,543 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:09,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2131195780, now seen corresponding path program 6 times [2019-10-01 22:29:09,546 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:09,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:09,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:09,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:09,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 4 proven. 225 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-01 22:29:09,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:09,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:09,798 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:10,087 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-01 22:29:10,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:10,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:29:10,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-01 22:29:10,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:10,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:29:10,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:29:10,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:29:10,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:29:10,136 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand 19 states. [2019-10-01 22:29:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:10,204 INFO L93 Difference]: Finished difference Result 186 states and 222 transitions. [2019-10-01 22:29:10,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:29:10,205 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2019-10-01 22:29:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:10,207 INFO L225 Difference]: With dead ends: 186 [2019-10-01 22:29:10,207 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 22:29:10,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 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:29:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 22:29:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-10-01 22:29:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 22:29:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2019-10-01 22:29:10,215 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 85 [2019-10-01 22:29:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:10,216 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2019-10-01 22:29:10,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:29:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2019-10-01 22:29:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-01 22:29:10,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:10,217 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:10,217 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:10,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1960493150, now seen corresponding path program 7 times [2019-10-01 22:29:10,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:10,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:10,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:10,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:10,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 4 proven. 256 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-01 22:29:10,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:10,492 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:29:10,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:10,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:29:10,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-01 22:29:10,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:10,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:29:10,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:29:10,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:29:10,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:29:10,622 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 20 states. [2019-10-01 22:29:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:10,686 INFO L93 Difference]: Finished difference Result 188 states and 224 transitions. [2019-10-01 22:29:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:29:10,687 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2019-10-01 22:29:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:10,688 INFO L225 Difference]: With dead ends: 188 [2019-10-01 22:29:10,688 INFO L226 Difference]: Without dead ends: 115 [2019-10-01 22:29:10,689 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 87 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:29:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-01 22:29:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-10-01 22:29:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-01 22:29:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2019-10-01 22:29:10,696 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 87 [2019-10-01 22:29:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:10,696 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2019-10-01 22:29:10,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:29:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2019-10-01 22:29:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-01 22:29:10,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:10,697 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:10,698 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash 116488256, now seen corresponding path program 8 times [2019-10-01 22:29:10,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:10,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:10,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 4 proven. 289 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-01 22:29:10,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:10,910 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:29:10,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:10,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:10,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:10,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:29:10,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-01 22:29:11,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:11,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 22:29:11,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:29:11,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:29:11,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:29:11,002 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 21 states. [2019-10-01 22:29:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:11,070 INFO L93 Difference]: Finished difference Result 190 states and 226 transitions. [2019-10-01 22:29:11,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:29:11,071 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2019-10-01 22:29:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:11,072 INFO L225 Difference]: With dead ends: 190 [2019-10-01 22:29:11,072 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 22:29:11,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 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:29:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 22:29:11,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-10-01 22:29:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-01 22:29:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2019-10-01 22:29:11,079 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 89 [2019-10-01 22:29:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:11,079 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2019-10-01 22:29:11,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:29:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2019-10-01 22:29:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-01 22:29:11,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:11,081 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:11,081 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1064173218, now seen corresponding path program 9 times [2019-10-01 22:29:11,081 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:11,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:11,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:11,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:11,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 4 proven. 324 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-01 22:29:11,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:11,308 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:29:11,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:11,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:29:11,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:11,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:29:11,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2019-10-01 22:29:11,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:11,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 29 [2019-10-01 22:29:11,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:29:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:29:11,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:29:11,520 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 29 states. [2019-10-01 22:29:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:11,677 INFO L93 Difference]: Finished difference Result 202 states and 244 transitions. [2019-10-01 22:29:11,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:29:11,680 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 91 [2019-10-01 22:29:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:11,681 INFO L225 Difference]: With dead ends: 202 [2019-10-01 22:29:11,681 INFO L226 Difference]: Without dead ends: 129 [2019-10-01 22:29:11,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:29:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-01 22:29:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2019-10-01 22:29:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-01 22:29:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2019-10-01 22:29:11,689 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 91 [2019-10-01 22:29:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:11,689 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2019-10-01 22:29:11,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:29:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2019-10-01 22:29:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 22:29:11,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:11,691 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:11,691 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:11,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash -561774121, now seen corresponding path program 10 times [2019-10-01 22:29:11,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:11,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:11,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 4 proven. 361 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 22:29:11,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:11,933 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:29:11,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:12,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:12,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:12,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:29:12,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-01 22:29:12,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:12,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:29:12,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:29:12,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:29:12,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:29:12,035 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand 23 states. [2019-10-01 22:29:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:12,116 INFO L93 Difference]: Finished difference Result 206 states and 246 transitions. [2019-10-01 22:29:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:29:12,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2019-10-01 22:29:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:12,118 INFO L225 Difference]: With dead ends: 206 [2019-10-01 22:29:12,118 INFO L226 Difference]: Without dead ends: 127 [2019-10-01 22:29:12,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 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:29:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-01 22:29:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-10-01 22:29:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-01 22:29:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2019-10-01 22:29:12,126 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 96 [2019-10-01 22:29:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:12,126 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2019-10-01 22:29:12,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:29:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2019-10-01 22:29:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 22:29:12,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:12,128 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:12,128 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:12,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1102406919, now seen corresponding path program 11 times [2019-10-01 22:29:12,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:12,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:12,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 4 proven. 400 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 22:29:12,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:12,391 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:29:12,427 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:13,042 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-10-01 22:29:13,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:13,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:29:13,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-10-01 22:29:13,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:13,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11] total 32 [2019-10-01 22:29:13,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 22:29:13,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 22:29:13,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:29:13,269 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand 32 states. [2019-10-01 22:29:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:13,448 INFO L93 Difference]: Finished difference Result 218 states and 264 transitions. [2019-10-01 22:29:13,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 22:29:13,449 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 98 [2019-10-01 22:29:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:13,453 INFO L225 Difference]: With dead ends: 218 [2019-10-01 22:29:13,453 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 22:29:13,455 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:29:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 22:29:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2019-10-01 22:29:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-01 22:29:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2019-10-01 22:29:13,468 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 98 [2019-10-01 22:29:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:13,468 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2019-10-01 22:29:13,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 22:29:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2019-10-01 22:29:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 22:29:13,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:13,470 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:13,470 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:13,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:13,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1047097128, now seen corresponding path program 12 times [2019-10-01 22:29:13,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:13,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:13,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 4 proven. 441 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-01 22:29:13,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:13,745 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:29:13,774 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:14,083 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:29:14,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:14,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 22:29:14,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:14,881 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:14,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2019-10-01 22:29:14,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:29:14,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:14,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:29:14,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:3 [2019-10-01 22:29:14,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 3 proven. 73 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-10-01 22:29:14,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:14,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2019-10-01 22:29:14,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:29:14,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:29:14,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:29:14,976 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand 43 states. [2019-10-01 22:29:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:39,520 INFO L93 Difference]: Finished difference Result 272 states and 332 transitions. [2019-10-01 22:29:39,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 22:29:39,521 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 103 [2019-10-01 22:29:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:39,522 INFO L225 Difference]: With dead ends: 272 [2019-10-01 22:29:39,522 INFO L226 Difference]: Without dead ends: 187 [2019-10-01 22:29:39,526 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1069, Invalid=6413, Unknown=0, NotChecked=0, Total=7482 [2019-10-01 22:29:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-01 22:29:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 144. [2019-10-01 22:29:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-01 22:29:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 166 transitions. [2019-10-01 22:29:39,536 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 166 transitions. Word has length 103 [2019-10-01 22:29:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:39,536 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 166 transitions. [2019-10-01 22:29:39,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:29:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 166 transitions. [2019-10-01 22:29:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-01 22:29:39,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:39,538 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 9, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:39,538 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:39,539 INFO L82 PathProgramCache]: Analyzing trace with hash 677538345, now seen corresponding path program 13 times [2019-10-01 22:29:39,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:39,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:39,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:39,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 6 proven. 484 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-01 22:29:39,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:39,888 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:29:39,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:39,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:29:39,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-01 22:29:40,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:40,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:29:40,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:29:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:29:40,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:29:40,008 INFO L87 Difference]: Start difference. First operand 144 states and 166 transitions. Second operand 26 states. [2019-10-01 22:29:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:40,094 INFO L93 Difference]: Finished difference Result 240 states and 284 transitions. [2019-10-01 22:29:40,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:29:40,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 113 [2019-10-01 22:29:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:40,096 INFO L225 Difference]: With dead ends: 240 [2019-10-01 22:29:40,097 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 22:29:40,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:29:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 22:29:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-10-01 22:29:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-01 22:29:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 168 transitions. [2019-10-01 22:29:40,111 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 168 transitions. Word has length 113 [2019-10-01 22:29:40,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:40,111 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 168 transitions. [2019-10-01 22:29:40,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:29:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2019-10-01 22:29:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-01 22:29:40,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:40,113 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 9, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:40,113 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:40,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:40,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1491138887, now seen corresponding path program 14 times [2019-10-01 22:29:40,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:40,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:40,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:40,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:40,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 7 proven. 117 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-10-01 22:29:40,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:40,231 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:29:40,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:40,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:40,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:40,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:29:40,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-01 22:29:40,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:40,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 26] total 36 [2019-10-01 22:29:40,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:29:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:29:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=870, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:29:40,696 INFO L87 Difference]: Start difference. First operand 146 states and 168 transitions. Second operand 36 states. [2019-10-01 22:29:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:40,852 INFO L93 Difference]: Finished difference Result 252 states and 302 transitions. [2019-10-01 22:29:40,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 22:29:40,853 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 115 [2019-10-01 22:29:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:40,854 INFO L225 Difference]: With dead ends: 252 [2019-10-01 22:29:40,854 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 22:29:40,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=390, Invalid=870, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:29:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 22:29:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154. [2019-10-01 22:29:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-01 22:29:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2019-10-01 22:29:40,865 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 115 [2019-10-01 22:29:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:40,866 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2019-10-01 22:29:40,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:29:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2019-10-01 22:29:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-01 22:29:40,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:40,867 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:40,868 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1332744852, now seen corresponding path program 15 times [2019-10-01 22:29:40,869 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:40,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:40,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:40,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 7 proven. 145 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-01 22:29:41,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:41,061 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:29:41,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:41,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 22:29:41,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:41,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:29:41,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-10-01 22:29:41,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:41,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:29:41,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:29:41,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:29:41,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:29:41,340 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 14 states. [2019-10-01 22:29:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:41,419 INFO L93 Difference]: Finished difference Result 262 states and 315 transitions. [2019-10-01 22:29:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:29:41,420 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-10-01 22:29:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:41,421 INFO L225 Difference]: With dead ends: 262 [2019-10-01 22:29:41,422 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 22:29:41,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:29:41,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 22:29:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2019-10-01 22:29:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-01 22:29:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2019-10-01 22:29:41,432 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 120 [2019-10-01 22:29:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:41,432 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2019-10-01 22:29:41,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:29:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2019-10-01 22:29:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-01 22:29:41,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:41,435 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 11, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:41,435 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:41,436 INFO L82 PathProgramCache]: Analyzing trace with hash -7526779, now seen corresponding path program 16 times [2019-10-01 22:29:41,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:41,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:41,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:41,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 6 proven. 576 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-10-01 22:29:41,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:41,896 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:29:41,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:42,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:42,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:42,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:29:42,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:42,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:42,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 22:29:42,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:29:42,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:29:42,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:29:42,033 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand 28 states. [2019-10-01 22:29:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:42,116 INFO L93 Difference]: Finished difference Result 268 states and 320 transitions. [2019-10-01 22:29:42,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:29:42,117 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 123 [2019-10-01 22:29:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:42,119 INFO L225 Difference]: With dead ends: 268 [2019-10-01 22:29:42,119 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 22:29:42,120 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:29:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 22:29:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-10-01 22:29:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-01 22:29:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2019-10-01 22:29:42,128 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 123 [2019-10-01 22:29:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:42,129 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2019-10-01 22:29:42,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:29:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2019-10-01 22:29:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-01 22:29:42,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:42,131 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 11, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:42,131 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1563551779, now seen corresponding path program 17 times [2019-10-01 22:29:42,131 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:42,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:42,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:42,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:42,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 6 proven. 625 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-10-01 22:29:42,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:42,579 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:29:42,652 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:43,428 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-10-01 22:29:43,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:43,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:29:43,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 1 proven. 176 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2019-10-01 22:29:43,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:43,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 14] total 40 [2019-10-01 22:29:43,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 22:29:43,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 22:29:43,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=1092, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:29:43,687 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand 40 states. [2019-10-01 22:29:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:43,904 INFO L93 Difference]: Finished difference Result 280 states and 338 transitions. [2019-10-01 22:29:43,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:29:43,907 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 125 [2019-10-01 22:29:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:43,909 INFO L225 Difference]: With dead ends: 280 [2019-10-01 22:29:43,909 INFO L226 Difference]: Without dead ends: 175 [2019-10-01 22:29:43,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=468, Invalid=1092, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:29:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-01 22:29:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2019-10-01 22:29:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-01 22:29:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2019-10-01 22:29:43,919 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 125 [2019-10-01 22:29:43,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:43,920 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2019-10-01 22:29:43,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 22:29:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2019-10-01 22:29:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-01 22:29:43,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:43,921 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 12, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:43,922 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash -586562632, now seen corresponding path program 18 times [2019-10-01 22:29:43,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:43,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:43,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:43,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 7 proven. 210 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2019-10-01 22:29:44,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:44,067 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:29:44,114 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:47,521 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 22:29:47,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:47,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 22:29:47,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:48,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:48,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2019-10-01 22:29:48,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:29:48,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:48,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:29:48,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:3 [2019-10-01 22:29:48,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 6 proven. 135 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-10-01 22:29:48,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:48,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 36 [2019-10-01 22:29:48,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:29:48,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:29:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:29:48,204 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand 36 states. [2019-10-01 22:30:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:44,763 INFO L93 Difference]: Finished difference Result 357 states and 441 transitions. [2019-10-01 22:30:44,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-01 22:30:44,763 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 130 [2019-10-01 22:30:44,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:44,766 INFO L225 Difference]: With dead ends: 357 [2019-10-01 22:30:44,766 INFO L226 Difference]: Without dead ends: 247 [2019-10-01 22:30:44,770 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1314, Invalid=6518, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 22:30:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-01 22:30:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 184. [2019-10-01 22:30:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-01 22:30:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions. [2019-10-01 22:30:44,784 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 130 [2019-10-01 22:30:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:44,785 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 214 transitions. [2019-10-01 22:30:44,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:30:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions. [2019-10-01 22:30:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-01 22:30:44,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:44,789 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:44,789 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:44,790 INFO L82 PathProgramCache]: Analyzing trace with hash 702035092, now seen corresponding path program 19 times [2019-10-01 22:30:44,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:44,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:44,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 8 proven. 676 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-10-01 22:30:45,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:45,319 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:30:45,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:45,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:30:45,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-01 22:30:45,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:45,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 22:30:45,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:30:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:30:45,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:30:45,501 INFO L87 Difference]: Start difference. First operand 184 states and 214 transitions. Second operand 30 states. [2019-10-01 22:30:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:45,600 INFO L93 Difference]: Finished difference Result 312 states and 372 transitions. [2019-10-01 22:30:45,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:30:45,600 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 141 [2019-10-01 22:30:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:45,602 INFO L225 Difference]: With dead ends: 312 [2019-10-01 22:30:45,602 INFO L226 Difference]: Without dead ends: 187 [2019-10-01 22:30:45,604 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:30:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-01 22:30:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-10-01 22:30:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-01 22:30:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 216 transitions. [2019-10-01 22:30:45,615 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 216 transitions. Word has length 141 [2019-10-01 22:30:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:45,616 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 216 transitions. [2019-10-01 22:30:45,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:30:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 216 transitions. [2019-10-01 22:30:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-01 22:30:45,617 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:45,618 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:45,618 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1230441138, now seen corresponding path program 20 times [2019-10-01 22:30:45,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:45,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:45,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:45,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 8 proven. 729 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-10-01 22:30:46,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:46,011 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:30:46,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:30:46,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:30:46,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:46,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:30:46,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-01 22:30:46,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:46,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 22:30:46,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:30:46,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:30:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:30:46,187 INFO L87 Difference]: Start difference. First operand 186 states and 216 transitions. Second operand 31 states. [2019-10-01 22:30:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:46,305 INFO L93 Difference]: Finished difference Result 314 states and 374 transitions. [2019-10-01 22:30:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:30:46,305 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2019-10-01 22:30:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:46,307 INFO L225 Difference]: With dead ends: 314 [2019-10-01 22:30:46,307 INFO L226 Difference]: Without dead ends: 189 [2019-10-01 22:30:46,310 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 143 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:30:46,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-01 22:30:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-10-01 22:30:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-01 22:30:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 218 transitions. [2019-10-01 22:30:46,319 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 218 transitions. Word has length 143 [2019-10-01 22:30:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:46,320 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 218 transitions. [2019-10-01 22:30:46,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:30:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 218 transitions. [2019-10-01 22:30:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-01 22:30:46,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:46,322 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:46,322 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2072456880, now seen corresponding path program 21 times [2019-10-01 22:30:46,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:46,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:46,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 8 proven. 784 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-10-01 22:30:46,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:46,857 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:30:46,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:30:47,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 22:30:47,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:47,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:30:47,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2019-10-01 22:30:47,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:47,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 16] total 45 [2019-10-01 22:30:47,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 22:30:47,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 22:30:47,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=1396, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:30:47,540 INFO L87 Difference]: Start difference. First operand 188 states and 218 transitions. Second operand 45 states. [2019-10-01 22:30:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:47,783 INFO L93 Difference]: Finished difference Result 326 states and 392 transitions. [2019-10-01 22:30:47,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 22:30:47,789 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 145 [2019-10-01 22:30:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:47,790 INFO L225 Difference]: With dead ends: 326 [2019-10-01 22:30:47,790 INFO L226 Difference]: Without dead ends: 201 [2019-10-01 22:30:47,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=584, Invalid=1396, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:30:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-01 22:30:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2019-10-01 22:30:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-01 22:30:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2019-10-01 22:30:47,801 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 145 [2019-10-01 22:30:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:47,802 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2019-10-01 22:30:47,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 22:30:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2019-10-01 22:30:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-01 22:30:47,803 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:47,803 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 14, 14, 14, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:47,804 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash 511109041, now seen corresponding path program 22 times [2019-10-01 22:30:47,804 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:47,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:47,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:47,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:47,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 8 proven. 841 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-10-01 22:30:48,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:48,342 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:30:48,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:30:48,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:30:48,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:48,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 22:30:48,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-10-01 22:30:48,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:48,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 22:30:48,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 22:30:48,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 22:30:48,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:30:48,507 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand 33 states. [2019-10-01 22:30:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:48,627 INFO L93 Difference]: Finished difference Result 330 states and 394 transitions. [2019-10-01 22:30:48,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 22:30:48,628 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 150 [2019-10-01 22:30:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:48,629 INFO L225 Difference]: With dead ends: 330 [2019-10-01 22:30:48,629 INFO L226 Difference]: Without dead ends: 199 [2019-10-01 22:30:48,630 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:30:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-01 22:30:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-10-01 22:30:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-01 22:30:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 230 transitions. [2019-10-01 22:30:48,639 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 230 transitions. Word has length 150 [2019-10-01 22:30:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:48,640 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 230 transitions. [2019-10-01 22:30:48,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 22:30:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 230 transitions. [2019-10-01 22:30:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 22:30:48,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:48,641 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 14, 14, 14, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:48,641 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:48,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1847323821, now seen corresponding path program 23 times [2019-10-01 22:30:48,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:48,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:48,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:48,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:48,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 8 proven. 900 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-10-01 22:30:49,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:49,237 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:30:49,310 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:30:50,172 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 22:30:50,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:50,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:30:50,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2019-10-01 22:30:50,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:50,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 17] total 48 [2019-10-01 22:30:50,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:30:50,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:30:50,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=1593, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:30:50,494 INFO L87 Difference]: Start difference. First operand 198 states and 230 transitions. Second operand 48 states. [2019-10-01 22:30:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:50,760 INFO L93 Difference]: Finished difference Result 342 states and 412 transitions. [2019-10-01 22:30:50,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:30:50,762 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 152 [2019-10-01 22:30:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:50,763 INFO L225 Difference]: With dead ends: 342 [2019-10-01 22:30:50,763 INFO L226 Difference]: Without dead ends: 211 [2019-10-01 22:30:50,764 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=663, Invalid=1593, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:30:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-01 22:30:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-10-01 22:30:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-01 22:30:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 240 transitions. [2019-10-01 22:30:50,777 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 240 transitions. Word has length 152 [2019-10-01 22:30:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:50,777 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 240 transitions. [2019-10-01 22:30:50,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:30:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 240 transitions. [2019-10-01 22:30:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-01 22:30:50,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:50,779 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 15, 15, 15, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:50,779 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:50,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1376575562, now seen corresponding path program 24 times [2019-10-01 22:30:50,779 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:50,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:50,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 8 proven. 961 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-01 22:30:51,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:51,272 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:30:51,346 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:30:57,180 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-10-01 22:30:57,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:57,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 22:30:57,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:58,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:30:58,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2019-10-01 22:30:58,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:30:58,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:30:58,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:30:58,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:3 [2019-10-01 22:30:58,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:30:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 9 proven. 216 refuted. 0 times theorem prover too weak. 1131 trivial. 0 not checked. [2019-10-01 22:30:58,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:58,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 25] total 57 [2019-10-01 22:30:58,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 22:30:58,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 22:30:58,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=2541, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:30:58,501 INFO L87 Difference]: Start difference. First operand 206 states and 240 transitions. Second operand 57 states. [2019-10-01 22:31:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:38,840 INFO L93 Difference]: Finished difference Result 420 states and 512 transitions. [2019-10-01 22:31:38,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 22:31:38,841 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 157 [2019-10-01 22:31:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:38,843 INFO L225 Difference]: With dead ends: 420 [2019-10-01 22:31:38,843 INFO L226 Difference]: Without dead ends: 283 [2019-10-01 22:31:38,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3487 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2004, Invalid=12038, Unknown=0, NotChecked=0, Total=14042 [2019-10-01 22:31:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-01 22:31:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 216. [2019-10-01 22:31:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-01 22:31:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2019-10-01 22:31:38,857 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 157 [2019-10-01 22:31:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:38,857 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2019-10-01 22:31:38,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 22:31:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2019-10-01 22:31:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-01 22:31:38,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:38,859 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 15, 15, 15, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:38,859 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash -324713189, now seen corresponding path program 25 times [2019-10-01 22:31:38,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:38,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 10 proven. 1024 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-01 22:31:39,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:39,373 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:31:39,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:39,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:31:39,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-10-01 22:31:39,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:39,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:31:39,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:31:39,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:31:39,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:31:39,542 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand 36 states. [2019-10-01 22:31:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:39,667 INFO L93 Difference]: Finished difference Result 364 states and 432 transitions. [2019-10-01 22:31:39,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:31:39,667 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 167 [2019-10-01 22:31:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:39,669 INFO L225 Difference]: With dead ends: 364 [2019-10-01 22:31:39,669 INFO L226 Difference]: Without dead ends: 219 [2019-10-01 22:31:39,669 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 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:31:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-01 22:31:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2019-10-01 22:31:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-10-01 22:31:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 252 transitions. [2019-10-01 22:31:39,681 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 252 transitions. Word has length 167 [2019-10-01 22:31:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:39,681 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 252 transitions. [2019-10-01 22:31:39,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:31:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 252 transitions. [2019-10-01 22:31:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-01 22:31:39,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:39,682 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 15, 15, 15, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:39,683 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:39,683 INFO L82 PathProgramCache]: Analyzing trace with hash 103059897, now seen corresponding path program 26 times [2019-10-01 22:31:39,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:39,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:39,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:39,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:39,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 10 proven. 1089 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-01 22:31:40,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:40,475 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:31:40,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:31:40,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:31:40,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:40,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:31:40,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-10-01 22:31:40,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:40,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 22:31:40,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 22:31:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 22:31:40,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:31:40,695 INFO L87 Difference]: Start difference. First operand 218 states and 252 transitions. Second operand 37 states. [2019-10-01 22:31:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:40,818 INFO L93 Difference]: Finished difference Result 366 states and 434 transitions. [2019-10-01 22:31:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 22:31:40,818 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 169 [2019-10-01 22:31:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:40,821 INFO L225 Difference]: With dead ends: 366 [2019-10-01 22:31:40,821 INFO L226 Difference]: Without dead ends: 221 [2019-10-01 22:31:40,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:31:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-01 22:31:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-10-01 22:31:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-01 22:31:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 254 transitions. [2019-10-01 22:31:40,834 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 254 transitions. Word has length 169 [2019-10-01 22:31:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:40,834 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 254 transitions. [2019-10-01 22:31:40,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 22:31:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2019-10-01 22:31:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-01 22:31:40,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:40,836 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 15, 15, 15, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:40,836 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:40,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:40,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1123864873, now seen corresponding path program 27 times [2019-10-01 22:31:40,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:40,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:40,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:40,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 10 proven. 1156 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-01 22:31:41,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:41,696 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:31:41,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:31:42,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 22:31:42,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:42,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:31:42,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 1 proven. 330 refuted. 0 times theorem prover too weak. 1256 trivial. 0 not checked. [2019-10-01 22:31:42,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:42,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 18] total 53 [2019-10-01 22:31:42,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:31:42,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:31:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=1938, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:31:42,460 INFO L87 Difference]: Start difference. First operand 220 states and 254 transitions. Second operand 53 states. [2019-10-01 22:31:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:42,780 INFO L93 Difference]: Finished difference Result 378 states and 452 transitions. [2019-10-01 22:31:42,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 22:31:42,781 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 171 [2019-10-01 22:31:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:42,782 INFO L225 Difference]: With dead ends: 378 [2019-10-01 22:31:42,782 INFO L226 Difference]: Without dead ends: 233 [2019-10-01 22:31:42,783 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=818, Invalid=1938, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:31:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-01 22:31:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 228. [2019-10-01 22:31:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-01 22:31:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 264 transitions. [2019-10-01 22:31:42,793 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 264 transitions. Word has length 171 [2019-10-01 22:31:42,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:42,794 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 264 transitions. [2019-10-01 22:31:42,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:31:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 264 transitions. [2019-10-01 22:31:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 22:31:42,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:42,795 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 16, 16, 16, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:42,795 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:42,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1638565488, now seen corresponding path program 28 times [2019-10-01 22:31:42,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:42,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:42,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1702 backedges. 10 proven. 1225 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-01 22:31:43,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:43,395 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:31:43,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:31:43,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:31:43,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:43,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 22:31:43,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1702 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-10-01 22:31:43,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:43,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 22:31:43,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 22:31:43,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 22:31:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:31:43,606 INFO L87 Difference]: Start difference. First operand 228 states and 264 transitions. Second operand 39 states. [2019-10-01 22:31:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:43,728 INFO L93 Difference]: Finished difference Result 382 states and 454 transitions. [2019-10-01 22:31:43,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:31:43,729 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 176 [2019-10-01 22:31:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:43,730 INFO L225 Difference]: With dead ends: 382 [2019-10-01 22:31:43,730 INFO L226 Difference]: Without dead ends: 231 [2019-10-01 22:31:43,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 176 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:31:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-01 22:31:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2019-10-01 22:31:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-01 22:31:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 266 transitions. [2019-10-01 22:31:43,741 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 266 transitions. Word has length 176 [2019-10-01 22:31:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:43,741 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 266 transitions. [2019-10-01 22:31:43,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 22:31:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 266 transitions. [2019-10-01 22:31:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-01 22:31:43,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:43,743 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 16, 16, 16, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:43,743 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1453293234, now seen corresponding path program 29 times [2019-10-01 22:31:43,743 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:43,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:43,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 10 proven. 1296 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-01 22:31:44,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:44,591 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:31:44,664 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:31:46,455 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-01 22:31:46,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:46,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:31:46,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 1396 trivial. 0 not checked. [2019-10-01 22:31:46,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:46,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 19] total 56 [2019-10-01 22:31:46,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 22:31:46,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 22:31:46,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=911, Invalid=2169, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:31:46,952 INFO L87 Difference]: Start difference. First operand 230 states and 266 transitions. Second operand 56 states. [2019-10-01 22:31:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:47,267 INFO L93 Difference]: Finished difference Result 394 states and 472 transitions. [2019-10-01 22:31:47,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 22:31:47,268 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 178 [2019-10-01 22:31:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:47,269 INFO L225 Difference]: With dead ends: 394 [2019-10-01 22:31:47,269 INFO L226 Difference]: Without dead ends: 243 [2019-10-01 22:31:47,269 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=911, Invalid=2169, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:31:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-01 22:31:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2019-10-01 22:31:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-01 22:31:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 276 transitions. [2019-10-01 22:31:47,278 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 276 transitions. Word has length 178 [2019-10-01 22:31:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:47,278 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 276 transitions. [2019-10-01 22:31:47,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 22:31:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 276 transitions. [2019-10-01 22:31:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-01 22:31:47,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:47,280 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 17, 17, 17, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:47,280 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:47,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:47,280 INFO L82 PathProgramCache]: Analyzing trace with hash 466571857, now seen corresponding path program 30 times [2019-10-01 22:31:47,280 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:47,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:47,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:47,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:47,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 10 proven. 1369 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2019-10-01 22:31:47,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:47,948 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:31:48,015 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:32:12,084 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-10-01 22:32:12,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:32:12,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:32:12,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:32:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 1 proven. 425 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2019-10-01 22:32:12,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:32:12,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 20] total 58 [2019-10-01 22:32:12,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 22:32:12,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 22:32:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=969, Invalid=2337, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:32:12,556 INFO L87 Difference]: Start difference. First operand 238 states and 276 transitions. Second operand 58 states. [2019-10-01 22:32:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:12,892 INFO L93 Difference]: Finished difference Result 408 states and 490 transitions. [2019-10-01 22:32:12,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:32:12,893 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 183 [2019-10-01 22:32:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:12,894 INFO L225 Difference]: With dead ends: 408 [2019-10-01 22:32:12,894 INFO L226 Difference]: Without dead ends: 251 [2019-10-01 22:32:12,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=969, Invalid=2337, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:32:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-01 22:32:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 246. [2019-10-01 22:32:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-10-01 22:32:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 286 transitions. [2019-10-01 22:32:12,906 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 286 transitions. Word has length 183 [2019-10-01 22:32:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:12,907 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 286 transitions. [2019-10-01 22:32:12,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 22:32:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 286 transitions. [2019-10-01 22:32:12,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-01 22:32:12,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:12,908 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 18, 18, 18, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:12,909 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:12,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:12,909 INFO L82 PathProgramCache]: Analyzing trace with hash -303789866, now seen corresponding path program 31 times [2019-10-01 22:32:12,909 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:12,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:12,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:32:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 10 proven. 1444 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2019-10-01 22:32:13,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:13,596 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:32:13,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:32:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:13,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:32:13,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:32:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-10-01 22:32:13,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:32:13,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 22:32:13,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:32:13,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:32:13,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:32:13,794 INFO L87 Difference]: Start difference. First operand 246 states and 286 transitions. Second operand 42 states. [2019-10-01 22:32:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:13,933 INFO L93 Difference]: Finished difference Result 412 states and 492 transitions. [2019-10-01 22:32:13,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:32:13,936 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 188 [2019-10-01 22:32:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:13,938 INFO L225 Difference]: With dead ends: 412 [2019-10-01 22:32:13,938 INFO L226 Difference]: Without dead ends: 249 [2019-10-01 22:32:13,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:32:13,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-01 22:32:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2019-10-01 22:32:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-01 22:32:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 288 transitions. [2019-10-01 22:32:13,950 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 288 transitions. Word has length 188 [2019-10-01 22:32:13,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:13,951 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 288 transitions. [2019-10-01 22:32:13,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:32:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 288 transitions. [2019-10-01 22:32:13,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-01 22:32:13,952 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:13,952 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 18, 18, 18, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:13,953 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:13,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:13,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1011488008, now seen corresponding path program 32 times [2019-10-01 22:32:13,953 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:13,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:13,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:13,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:32:13,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 10 proven. 1521 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2019-10-01 22:32:14,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:14,677 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:32:14,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:32:14,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:32:14,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:32:14,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 22:32:14,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:32:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-10-01 22:32:14,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:32:14,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 22:32:14,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:32:14,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:32:14,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:32:14,954 INFO L87 Difference]: Start difference. First operand 248 states and 288 transitions. Second operand 43 states. [2019-10-01 22:32:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:15,097 INFO L93 Difference]: Finished difference Result 414 states and 494 transitions. [2019-10-01 22:32:15,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:32:15,098 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 190 [2019-10-01 22:32:15,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:15,100 INFO L225 Difference]: With dead ends: 414 [2019-10-01 22:32:15,100 INFO L226 Difference]: Without dead ends: 251 [2019-10-01 22:32:15,101 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 190 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:32:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-01 22:32:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-10-01 22:32:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-01 22:32:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 290 transitions. [2019-10-01 22:32:15,112 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 290 transitions. Word has length 190 [2019-10-01 22:32:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:15,112 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 290 transitions. [2019-10-01 22:32:15,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:32:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 290 transitions. [2019-10-01 22:32:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 22:32:15,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:15,114 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 18, 18, 18, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:15,114 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:15,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:15,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1790397594, now seen corresponding path program 33 times [2019-10-01 22:32:15,114 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:15,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:15,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:15,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:32:15,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 10 proven. 1600 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2019-10-01 22:32:15,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:15,884 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:32:15,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:32:16,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 22:32:16,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:32:16,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 22:32:16,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:32:17,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:32:17,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2019-10-01 22:32:17,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:32:17,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:32:17,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:32:17,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:3 [2019-10-01 22:32:17,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:32:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 12 proven. 316 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2019-10-01 22:32:17,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:32:17,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 27] total 68 [2019-10-01 22:32:17,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 22:32:17,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 22:32:17,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1002, Invalid=3554, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:32:17,954 INFO L87 Difference]: Start difference. First operand 250 states and 290 transitions. Second operand 68 states. [2019-10-01 22:32:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:58,935 INFO L93 Difference]: Finished difference Result 502 states and 610 transitions. [2019-10-01 22:32:58,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-10-01 22:32:58,935 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 192 [2019-10-01 22:32:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:58,938 INFO L225 Difference]: With dead ends: 502 [2019-10-01 22:32:58,938 INFO L226 Difference]: Without dead ends: 339 [2019-10-01 22:32:58,940 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 160 SyntacticMatches, 8 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3070, Invalid=17236, Unknown=0, NotChecked=0, Total=20306 [2019-10-01 22:32:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-10-01 22:32:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 260. [2019-10-01 22:32:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-01 22:32:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 300 transitions. [2019-10-01 22:32:58,953 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 300 transitions. Word has length 192 [2019-10-01 22:32:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:58,954 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 300 transitions. [2019-10-01 22:32:58,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 22:32:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 300 transitions. [2019-10-01 22:32:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 22:32:58,955 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:58,955 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 18, 18, 18, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:58,956 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:58,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2043296657, now seen corresponding path program 34 times [2019-10-01 22:32:58,956 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:58,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:58,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:58,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:32:58,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2303 backedges. 12 proven. 1681 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-10-01 22:33:00,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:00,036 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:33:00,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:33:00,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:33:00,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:00,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 22:33:00,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2303 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2019-10-01 22:33:00,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:00,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 22:33:00,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 22:33:00,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 22:33:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:33:00,252 INFO L87 Difference]: Start difference. First operand 260 states and 300 transitions. Second operand 45 states. [2019-10-01 22:33:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:00,395 INFO L93 Difference]: Finished difference Result 434 states and 514 transitions. [2019-10-01 22:33:00,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 22:33:00,396 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 202 [2019-10-01 22:33:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:00,398 INFO L225 Difference]: With dead ends: 434 [2019-10-01 22:33:00,398 INFO L226 Difference]: Without dead ends: 263 [2019-10-01 22:33:00,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:33:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-01 22:33:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-10-01 22:33:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-01 22:33:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 302 transitions. [2019-10-01 22:33:00,414 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 302 transitions. Word has length 202 [2019-10-01 22:33:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:00,414 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 302 transitions. [2019-10-01 22:33:00,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 22:33:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 302 transitions. [2019-10-01 22:33:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 22:33:00,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:00,416 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 18, 18, 18, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:00,416 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1209516817, now seen corresponding path program 35 times [2019-10-01 22:33:00,416 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:00,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:00,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:00,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:00,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2386 backedges. 12 proven. 1764 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-10-01 22:33:01,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:01,253 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:33:01,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:33:15,014 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-01 22:33:15,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:15,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:33:15,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2386 backedges. 1 proven. 477 refuted. 0 times theorem prover too weak. 1908 trivial. 0 not checked. [2019-10-01 22:33:15,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:15,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 21] total 64 [2019-10-01 22:33:15,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-01 22:33:15,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-01 22:33:15,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=2833, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:33:15,557 INFO L87 Difference]: Start difference. First operand 262 states and 302 transitions. Second operand 64 states. [2019-10-01 22:33:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:15,957 INFO L93 Difference]: Finished difference Result 446 states and 532 transitions. [2019-10-01 22:33:15,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 22:33:15,958 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 204 [2019-10-01 22:33:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:15,959 INFO L225 Difference]: With dead ends: 446 [2019-10-01 22:33:15,960 INFO L226 Difference]: Without dead ends: 275 [2019-10-01 22:33:15,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1199, Invalid=2833, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:33:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-01 22:33:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 270. [2019-10-01 22:33:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-01 22:33:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 312 transitions. [2019-10-01 22:33:15,973 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 312 transitions. Word has length 204 [2019-10-01 22:33:15,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:15,974 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 312 transitions. [2019-10-01 22:33:15,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-01 22:33:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 312 transitions. [2019-10-01 22:33:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-01 22:33:15,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:15,975 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 19, 19, 19, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:15,976 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1333623464, now seen corresponding path program 36 times [2019-10-01 22:33:15,976 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:15,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:15,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:15,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:15,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 12 proven. 1849 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2019-10-01 22:33:16,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:16,820 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:33:16,900 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:33:26,459 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2019-10-01 22:33:26,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:26,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:33:26,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 1993 trivial. 0 not checked. [2019-10-01 22:33:27,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:27,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 22] total 66 [2019-10-01 22:33:27,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:33:27,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:33:27,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1265, Invalid=3025, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:33:27,037 INFO L87 Difference]: Start difference. First operand 270 states and 312 transitions. Second operand 66 states. [2019-10-01 22:33:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:27,443 INFO L93 Difference]: Finished difference Result 460 states and 550 transitions. [2019-10-01 22:33:27,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:33:27,449 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 209 [2019-10-01 22:33:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:27,450 INFO L225 Difference]: With dead ends: 460 [2019-10-01 22:33:27,451 INFO L226 Difference]: Without dead ends: 283 [2019-10-01 22:33:27,452 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1265, Invalid=3025, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:33:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-01 22:33:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2019-10-01 22:33:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-01 22:33:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 322 transitions. [2019-10-01 22:33:27,465 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 322 transitions. Word has length 209 [2019-10-01 22:33:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:27,465 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 322 transitions. [2019-10-01 22:33:27,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:33:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 322 transitions. [2019-10-01 22:33:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 22:33:27,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:27,467 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 20, 20, 20, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:27,467 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:27,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash -926904523, now seen corresponding path program 37 times [2019-10-01 22:33:27,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:27,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:27,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:27,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:27,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2671 backedges. 12 proven. 1936 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2019-10-01 22:33:28,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:28,374 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 22:33:28,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:33:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:28,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:33:28,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2671 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-01 22:33:28,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:28,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 22:33:28,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:33:28,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:33:28,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:33:28,604 INFO L87 Difference]: Start difference. First operand 278 states and 322 transitions. Second operand 48 states. [2019-10-01 22:33:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:28,767 INFO L93 Difference]: Finished difference Result 464 states and 552 transitions. [2019-10-01 22:33:28,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:33:28,767 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 214 [2019-10-01 22:33:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:28,769 INFO L225 Difference]: With dead ends: 464 [2019-10-01 22:33:28,769 INFO L226 Difference]: Without dead ends: 281 [2019-10-01 22:33:28,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:33:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-01 22:33:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2019-10-01 22:33:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-01 22:33:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 324 transitions. [2019-10-01 22:33:28,785 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 324 transitions. Word has length 214 [2019-10-01 22:33:28,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:28,785 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 324 transitions. [2019-10-01 22:33:28,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:33:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 324 transitions. [2019-10-01 22:33:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-01 22:33:28,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:28,788 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 20, 20, 20, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:28,789 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:28,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1333810473, now seen corresponding path program 38 times [2019-10-01 22:33:28,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:28,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:28,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:28,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:33:28,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 12 proven. 2025 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2019-10-01 22:33:29,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:29,751 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 22:33:29,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:33:29,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:33:29,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:29,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 22:33:29,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-10-01 22:33:30,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:30,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-01 22:33:30,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 22:33:30,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 22:33:30,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:33:30,013 INFO L87 Difference]: Start difference. First operand 280 states and 324 transitions. Second operand 49 states. [2019-10-01 22:33:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:30,213 INFO L93 Difference]: Finished difference Result 466 states and 554 transitions. [2019-10-01 22:33:30,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:33:30,213 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 216 [2019-10-01 22:33:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:30,215 INFO L225 Difference]: With dead ends: 466 [2019-10-01 22:33:30,215 INFO L226 Difference]: Without dead ends: 283 [2019-10-01 22:33:30,215 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:33:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-01 22:33:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 282. [2019-10-01 22:33:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-10-01 22:33:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 326 transitions. [2019-10-01 22:33:30,227 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 326 transitions. Word has length 216 [2019-10-01 22:33:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:30,228 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 326 transitions. [2019-10-01 22:33:30,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 22:33:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 326 transitions. [2019-10-01 22:33:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-01 22:33:30,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:30,229 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 20, 20, 20, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:30,230 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:30,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:30,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1528404487, now seen corresponding path program 39 times [2019-10-01 22:33:30,230 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:30,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:30,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:30,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:30,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2851 backedges. 12 proven. 2116 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2019-10-01 22:33:31,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:31,590 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 22:33:31,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:33:32,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-10-01 22:33:32,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:32,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:33:32,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2851 backedges. 1 proven. 590 refuted. 0 times theorem prover too weak. 2260 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (49)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:33:33,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:33,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 23] total 70 [2019-10-01 22:33:33,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 22:33:33,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 22:33:33,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1428, Invalid=3402, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:33:33,778 INFO L87 Difference]: Start difference. First operand 282 states and 326 transitions. Second operand 70 states. [2019-10-01 22:33:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:34,111 INFO L93 Difference]: Finished difference Result 478 states and 572 transitions. [2019-10-01 22:33:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 22:33:34,119 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 218 [2019-10-01 22:33:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:34,120 INFO L225 Difference]: With dead ends: 478 [2019-10-01 22:33:34,120 INFO L226 Difference]: Without dead ends: 295 [2019-10-01 22:33:34,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1428, Invalid=3402, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:33:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-01 22:33:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 290. [2019-10-01 22:33:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-01 22:33:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 336 transitions. [2019-10-01 22:33:34,145 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 336 transitions. Word has length 218 [2019-10-01 22:33:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:34,146 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 336 transitions. [2019-10-01 22:33:34,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 22:33:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 336 transitions. [2019-10-01 22:33:34,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-01 22:33:34,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:34,149 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 21, 21, 21, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:34,149 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash 746532080, now seen corresponding path program 40 times [2019-10-01 22:33:34,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:34,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:34,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:34,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:34,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3005 backedges. 12 proven. 2209 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:33:35,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:35,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 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 22:33:35,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:33:35,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:33:35,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:35,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 22:33:35,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3005 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 796 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:33:35,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:35,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-01 22:33:35,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:33:35,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:33:35,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:33:35,529 INFO L87 Difference]: Start difference. First operand 290 states and 336 transitions. Second operand 51 states. [2019-10-01 22:33:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:35,691 INFO L93 Difference]: Finished difference Result 482 states and 574 transitions. [2019-10-01 22:33:35,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 22:33:35,692 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 223 [2019-10-01 22:33:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:35,693 INFO L225 Difference]: With dead ends: 482 [2019-10-01 22:33:35,693 INFO L226 Difference]: Without dead ends: 293 [2019-10-01 22:33:35,694 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:33:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-01 22:33:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-10-01 22:33:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-01 22:33:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 338 transitions. [2019-10-01 22:33:35,710 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 338 transitions. Word has length 223 [2019-10-01 22:33:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:35,711 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 338 transitions. [2019-10-01 22:33:35,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:33:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 338 transitions. [2019-10-01 22:33:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-01 22:33:35,713 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:35,713 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 21, 21, 21, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:35,713 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash -519567474, now seen corresponding path program 41 times [2019-10-01 22:33:35,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:35,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:35,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:35,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:35,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3100 backedges. 12 proven. 2304 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:33:37,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:37,110 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 22:33:37,204 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:33:42,302 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-10-01 22:33:42,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:42,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:33:42,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3100 backedges. 1 proven. 651 refuted. 0 times theorem prover too weak. 2448 trivial. 0 not checked. [2019-10-01 22:33:42,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:42,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 24] total 73 [2019-10-01 22:33:42,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 22:33:42,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 22:33:42,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=3706, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:33:42,977 INFO L87 Difference]: Start difference. First operand 292 states and 338 transitions. Second operand 73 states. [2019-10-01 22:33:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:43,315 INFO L93 Difference]: Finished difference Result 494 states and 592 transitions. [2019-10-01 22:33:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 22:33:43,315 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 225 [2019-10-01 22:33:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:43,317 INFO L225 Difference]: With dead ends: 494 [2019-10-01 22:33:43,317 INFO L226 Difference]: Without dead ends: 305 [2019-10-01 22:33:43,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1550, Invalid=3706, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:33:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-01 22:33:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 300. [2019-10-01 22:33:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-01 22:33:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 348 transitions. [2019-10-01 22:33:43,330 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 348 transitions. Word has length 225 [2019-10-01 22:33:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:43,330 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 348 transitions. [2019-10-01 22:33:43,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 22:33:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 348 transitions. [2019-10-01 22:33:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 22:33:43,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:43,332 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 22, 22, 22, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:43,332 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:43,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2032391487, now seen corresponding path program 42 times [2019-10-01 22:33:43,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:43,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:43,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:43,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:43,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3261 backedges. 12 proven. 2401 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2019-10-01 22:33:44,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:44,394 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 22:33:44,492 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:34:01,565 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-10-01 22:34:01,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:34:01,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 22:34:01,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:03,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:34:03,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2019-10-01 22:34:03,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:34:03,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:34:03,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:34:03,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:3 [2019-10-01 22:34:03,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:34:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3261 backedges. 15 proven. 455 refuted. 0 times theorem prover too weak. 2791 trivial. 0 not checked. [2019-10-01 22:34:03,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:03,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 29] total 79 [2019-10-01 22:34:03,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-01 22:34:03,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-01 22:34:03,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=4728, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:34:03,504 INFO L87 Difference]: Start difference. First operand 300 states and 348 transitions. Second operand 79 states. [2019-10-01 22:34:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:53,502 INFO L93 Difference]: Finished difference Result 599 states and 728 transitions. [2019-10-01 22:34:53,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-10-01 22:34:53,502 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 230 [2019-10-01 22:34:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:53,504 INFO L225 Difference]: With dead ends: 599 [2019-10-01 22:34:53,504 INFO L226 Difference]: Without dead ends: 404 [2019-10-01 22:34:53,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 194 SyntacticMatches, 10 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6814 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4379, Invalid=23343, Unknown=0, NotChecked=0, Total=27722 [2019-10-01 22:34:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-10-01 22:34:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 310. [2019-10-01 22:34:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-10-01 22:34:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 358 transitions. [2019-10-01 22:34:53,522 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 358 transitions. Word has length 230 [2019-10-01 22:34:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:53,522 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 358 transitions. [2019-10-01 22:34:53,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-01 22:34:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 358 transitions. [2019-10-01 22:34:53,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-01 22:34:53,527 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:53,527 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 22, 22, 22, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:53,528 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:53,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:53,528 INFO L82 PathProgramCache]: Analyzing trace with hash -219189612, now seen corresponding path program 43 times [2019-10-01 22:34:53,528 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:53,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:53,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:34:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 15 proven. 715 refuted. 0 times theorem prover too weak. 2682 trivial. 0 not checked. [2019-10-01 22:34:53,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:34:53,861 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 22:34:53,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:34:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:54,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 22:34:54,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2019-10-01 22:34:55,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:55,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 53] total 76 [2019-10-01 22:34:55,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-01 22:34:55,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-01 22:34:55,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1677, Invalid=4023, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 22:34:55,612 INFO L87 Difference]: Start difference. First operand 310 states and 358 transitions. Second operand 76 states. [2019-10-01 22:34:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:55,953 INFO L93 Difference]: Finished difference Result 526 states and 628 transitions. [2019-10-01 22:34:55,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-01 22:34:55,955 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 240 [2019-10-01 22:34:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:55,957 INFO L225 Difference]: With dead ends: 526 [2019-10-01 22:34:55,957 INFO L226 Difference]: Without dead ends: 323 [2019-10-01 22:34:55,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1677, Invalid=4023, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 22:34:55,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-01 22:34:55,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 318. [2019-10-01 22:34:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-01 22:34:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 368 transitions. [2019-10-01 22:34:55,972 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 368 transitions. Word has length 240 [2019-10-01 22:34:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:55,972 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 368 transitions. [2019-10-01 22:34:55,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-01 22:34:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 368 transitions. [2019-10-01 22:34:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-01 22:34:55,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:55,974 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 23, 23, 23, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:55,974 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -374850757, now seen corresponding path program 44 times [2019-10-01 22:34:55,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:55,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:55,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:55,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:34:55,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3580 backedges. 14 proven. 2601 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-10-01 22:34:57,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:34:57,106 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 22:34:57,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:34:57,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:34:57,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:34:57,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 22:34:57,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3580 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2019-10-01 22:34:57,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:57,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-01 22:34:57,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 22:34:57,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 22:34:57,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:34:57,355 INFO L87 Difference]: Start difference. First operand 318 states and 368 transitions. Second operand 55 states. [2019-10-01 22:34:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:57,544 INFO L93 Difference]: Finished difference Result 530 states and 630 transitions. [2019-10-01 22:34:57,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 22:34:57,545 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 245 [2019-10-01 22:34:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:57,546 INFO L225 Difference]: With dead ends: 530 [2019-10-01 22:34:57,546 INFO L226 Difference]: Without dead ends: 321 [2019-10-01 22:34:57,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 245 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 22:34:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-01 22:34:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 320. [2019-10-01 22:34:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-01 22:34:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 370 transitions. [2019-10-01 22:34:57,560 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 370 transitions. Word has length 245 [2019-10-01 22:34:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:57,561 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 370 transitions. [2019-10-01 22:34:57,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 22:34:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 370 transitions. [2019-10-01 22:34:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-01 22:34:57,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:57,563 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 23, 23, 23, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:57,563 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:57,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:57,563 INFO L82 PathProgramCache]: Analyzing trace with hash 256781145, now seen corresponding path program 45 times [2019-10-01 22:34:57,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:57,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:57,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:57,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:34:57,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 15 proven. 782 refuted. 0 times theorem prover too weak. 2886 trivial. 0 not checked. [2019-10-01 22:34:57,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:34:57,936 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 22:34:58,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:35:00,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-10-01 22:35:00,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:00,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:35:00,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 104 proven. 782 refuted. 0 times theorem prover too weak. 2797 trivial. 0 not checked. [2019-10-01 22:35:00,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:00,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 29 [2019-10-01 22:35:00,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:35:00,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:35:00,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:35:00,231 INFO L87 Difference]: Start difference. First operand 320 states and 370 transitions. Second operand 29 states. [2019-10-01 22:35:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:00,738 INFO L93 Difference]: Finished difference Result 538 states and 643 transitions. [2019-10-01 22:35:00,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:35:00,738 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 247 [2019-10-01 22:35:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:00,740 INFO L225 Difference]: With dead ends: 538 [2019-10-01 22:35:00,740 INFO L226 Difference]: Without dead ends: 330 [2019-10-01 22:35:00,741 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1005, Invalid=1751, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:35:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-01 22:35:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 326. [2019-10-01 22:35:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-10-01 22:35:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 378 transitions. [2019-10-01 22:35:00,767 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 378 transitions. Word has length 247 [2019-10-01 22:35:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:00,768 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 378 transitions. [2019-10-01 22:35:00,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:35:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 378 transitions. [2019-10-01 22:35:00,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 22:35:00,770 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:00,770 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 24, 24, 24, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:00,770 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:00,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:00,771 INFO L82 PathProgramCache]: Analyzing trace with hash 911879352, now seen corresponding path program 46 times [2019-10-01 22:35:00,771 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:00,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:00,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:00,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:00,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3753 backedges. 14 proven. 2704 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-10-01 22:35:02,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:02,322 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 22:35:02,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:35:02,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:35:02,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:02,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 22:35:02,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3753 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 1049 trivial. 0 not checked. [2019-10-01 22:35:02,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:02,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 22:35:02,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 22:35:02,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 22:35:02,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:35:02,588 INFO L87 Difference]: Start difference. First operand 326 states and 378 transitions. Second operand 56 states. [2019-10-01 22:35:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:02,818 INFO L93 Difference]: Finished difference Result 544 states and 648 transitions. [2019-10-01 22:35:02,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 22:35:02,818 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 250 [2019-10-01 22:35:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:02,820 INFO L225 Difference]: With dead ends: 544 [2019-10-01 22:35:02,820 INFO L226 Difference]: Without dead ends: 329 [2019-10-01 22:35:02,820 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:35:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-10-01 22:35:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 328. [2019-10-01 22:35:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-01 22:35:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 380 transitions. [2019-10-01 22:35:02,835 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 380 transitions. Word has length 250 [2019-10-01 22:35:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:02,836 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 380 transitions. [2019-10-01 22:35:02,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 22:35:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 380 transitions. [2019-10-01 22:35:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 22:35:02,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:02,838 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 24, 24, 24, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:02,838 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:02,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1910792358, now seen corresponding path program 47 times [2019-10-01 22:35:02,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:02,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:02,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:02,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:02,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3858 backedges. 15 proven. 852 refuted. 0 times theorem prover too weak. 2991 trivial. 0 not checked. [2019-10-01 22:35:03,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:03,325 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 22:35:03,441 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:35:25,622 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-10-01 22:35:25,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:25,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:35:25,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3858 backedges. 1 proven. 852 refuted. 0 times theorem prover too weak. 3005 trivial. 0 not checked. [2019-10-01 22:35:25,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:25,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 22:35:25,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:35:25,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:35:25,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:35:25,774 INFO L87 Difference]: Start difference. First operand 328 states and 380 transitions. Second operand 28 states. [2019-10-01 22:35:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:25,924 INFO L93 Difference]: Finished difference Result 552 states and 661 transitions. [2019-10-01 22:35:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:35:25,924 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 252 [2019-10-01 22:35:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:25,926 INFO L225 Difference]: With dead ends: 552 [2019-10-01 22:35:25,926 INFO L226 Difference]: Without dead ends: 338 [2019-10-01 22:35:25,926 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:35:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-01 22:35:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2019-10-01 22:35:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-01 22:35:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 388 transitions. [2019-10-01 22:35:25,943 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 388 transitions. Word has length 252 [2019-10-01 22:35:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:25,943 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 388 transitions. [2019-10-01 22:35:25,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:35:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 388 transitions. [2019-10-01 22:35:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-01 22:35:25,945 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:25,945 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 25, 25, 25, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:25,946 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:25,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1562946839, now seen corresponding path program 48 times [2019-10-01 22:35:25,946 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:25,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:25,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:25,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:25,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3931 backedges. 15 proven. 925 refuted. 0 times theorem prover too weak. 2991 trivial. 0 not checked. [2019-10-01 22:35:26,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:26,478 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 22:35:26,597 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:36:35,271 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-10-01 22:36:35,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:36:35,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 22:36:35,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:36:36,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:36:36,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2019-10-01 22:36:36,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:36:36,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:36:36,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:36:36,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:3 [2019-10-01 22:36:36,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:36:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3931 backedges. 18 proven. 596 refuted. 0 times theorem prover too weak. 3317 trivial. 0 not checked. [2019-10-01 22:36:36,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:36:36,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 57 [2019-10-01 22:36:36,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 22:36:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 22:36:36,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=2517, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:36:36,753 INFO L87 Difference]: Start difference. First operand 334 states and 388 transitions. Second operand 57 states. [2019-10-01 22:37:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:37:46,096 INFO L93 Difference]: Finished difference Result 682 states and 835 transitions. [2019-10-01 22:37:46,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-10-01 22:37:46,096 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 255 [2019-10-01 22:37:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:37:46,098 INFO L225 Difference]: With dead ends: 682 [2019-10-01 22:37:46,098 INFO L226 Difference]: Without dead ends: 462 [2019-10-01 22:37:46,100 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 215 SyntacticMatches, 12 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8013 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4029, Invalid=19227, Unknown=0, NotChecked=0, Total=23256 [2019-10-01 22:37:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-10-01 22:37:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 348. [2019-10-01 22:37:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-01 22:37:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 404 transitions. [2019-10-01 22:37:46,116 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 404 transitions. Word has length 255 [2019-10-01 22:37:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:37:46,116 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 404 transitions. [2019-10-01 22:37:46,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 22:37:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 404 transitions. [2019-10-01 22:37:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-01 22:37:46,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:37:46,118 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 26, 26, 26, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:37:46,119 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:37:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:37:46,119 INFO L82 PathProgramCache]: Analyzing trace with hash -153353491, now seen corresponding path program 49 times [2019-10-01 22:37:46,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:37:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:37:46,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:46,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:37:46,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:37:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4067 backedges. 17 proven. 1001 refuted. 0 times theorem prover too weak. 3049 trivial. 0 not checked. [2019-10-01 22:37:46,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:37:46,614 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 22:37:46,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:37:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:37:46,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 22:37:46,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:37:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4067 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-10-01 22:37:48,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:37:48,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 56] total 83 [2019-10-01 22:37:48,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-01 22:37:48,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-01 22:37:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1945, Invalid=4861, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 22:37:48,544 INFO L87 Difference]: Start difference. First operand 348 states and 404 transitions. Second operand 83 states. [2019-10-01 22:37:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:37:48,919 INFO L93 Difference]: Finished difference Result 596 states and 714 transitions. [2019-10-01 22:37:48,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 22:37:48,919 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 266 [2019-10-01 22:37:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:37:48,921 INFO L225 Difference]: With dead ends: 596 [2019-10-01 22:37:48,921 INFO L226 Difference]: Without dead ends: 361 [2019-10-01 22:37:48,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1945, Invalid=4861, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 22:37:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-01 22:37:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 356. [2019-10-01 22:37:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-01 22:37:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 414 transitions. [2019-10-01 22:37:48,935 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 414 transitions. Word has length 266 [2019-10-01 22:37:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:37:48,935 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 414 transitions. [2019-10-01 22:37:48,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-01 22:37:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 414 transitions. [2019-10-01 22:37:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-01 22:37:48,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:37:48,937 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 27, 27, 27, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:37:48,939 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:37:48,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:37:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash -217401336, now seen corresponding path program 50 times [2019-10-01 22:37:48,940 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:37:48,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:37:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:48,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:37:48,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:37:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4253 backedges. 17 proven. 1080 refuted. 0 times theorem prover too weak. 3156 trivial. 0 not checked. [2019-10-01 22:37:49,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:37:49,468 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 22:37:49,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:37:49,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:37:49,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:37:49,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 22:37:49,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:37:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4253 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2019-10-01 22:37:51,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:37:51,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 57] total 85 [2019-10-01 22:37:51,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-01 22:37:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-01 22:37:51,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2030, Invalid=5110, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 22:37:51,590 INFO L87 Difference]: Start difference. First operand 356 states and 414 transitions. Second operand 85 states. [2019-10-01 22:37:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:37:51,993 INFO L93 Difference]: Finished difference Result 610 states and 732 transitions. [2019-10-01 22:37:51,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-01 22:37:51,994 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 271 [2019-10-01 22:37:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:37:51,995 INFO L225 Difference]: With dead ends: 610 [2019-10-01 22:37:51,995 INFO L226 Difference]: Without dead ends: 369 [2019-10-01 22:37:51,996 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2030, Invalid=5110, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 22:37:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-01 22:37:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2019-10-01 22:37:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-10-01 22:37:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 424 transitions. [2019-10-01 22:37:52,012 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 424 transitions. Word has length 271 [2019-10-01 22:37:52,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:37:52,012 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 424 transitions. [2019-10-01 22:37:52,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-01 22:37:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 424 transitions. [2019-10-01 22:37:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-01 22:37:52,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:37:52,014 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 28, 28, 28, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:37:52,014 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:37:52,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:37:52,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1282580591, now seen corresponding path program 51 times [2019-10-01 22:37:52,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:37:52,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:37:52,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:52,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:37:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:37:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4444 backedges. 16 proven. 3025 refuted. 0 times theorem prover too weak. 1403 trivial. 0 not checked. [2019-10-01 22:37:53,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:37:53,503 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 22:37:53,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:37:56,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-10-01 22:37:56,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:37:56,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-01 22:37:56,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:37:59,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:37:59,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2019-10-01 22:37:59,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:37:59,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:37:59,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:37:59,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:3 [2019-10-01 22:37:59,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:37:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4444 backedges. 21 proven. 756 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:37:59,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:37:59,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 33] total 89 [2019-10-01 22:37:59,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 22:37:59,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 22:37:59,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1779, Invalid=6053, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 22:37:59,405 INFO L87 Difference]: Start difference. First operand 364 states and 424 transitions. Second operand 89 states. [2019-10-01 22:38:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:38:48,112 INFO L93 Difference]: Finished difference Result 739 states and 900 transitions. [2019-10-01 22:38:48,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-10-01 22:38:48,112 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 276 [2019-10-01 22:38:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:38:48,115 INFO L225 Difference]: With dead ends: 739 [2019-10-01 22:38:48,115 INFO L226 Difference]: Without dead ends: 492 [2019-10-01 22:38:48,117 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 232 SyntacticMatches, 14 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9219 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=5440, Invalid=30850, Unknown=0, NotChecked=0, Total=36290 [2019-10-01 22:38:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-01 22:38:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 374. [2019-10-01 22:38:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-01 22:38:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 434 transitions. [2019-10-01 22:38:48,133 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 434 transitions. Word has length 276 [2019-10-01 22:38:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:38:48,133 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 434 transitions. [2019-10-01 22:38:48,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-01 22:38:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 434 transitions. [2019-10-01 22:38:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-01 22:38:48,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:38:48,135 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 28, 28, 28, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:38:48,136 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:38:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:38:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1095107738, now seen corresponding path program 52 times [2019-10-01 22:38:48,136 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:38:48,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:38:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:48,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:38:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:38:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 19 proven. 1162 refuted. 0 times theorem prover too weak. 3442 trivial. 0 not checked. [2019-10-01 22:38:48,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:38:48,612 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 22:38:48,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:38:48,871 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:38:48,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:38:48,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 22:38:48,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:38:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 1487 trivial. 0 not checked. [2019-10-01 22:38:51,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:38:51,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 59] total 88 [2019-10-01 22:38:51,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-10-01 22:38:51,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-10-01 22:38:51,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2175, Invalid=5481, Unknown=0, NotChecked=0, Total=7656 [2019-10-01 22:38:51,045 INFO L87 Difference]: Start difference. First operand 374 states and 434 transitions. Second operand 88 states. [2019-10-01 22:38:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:38:51,468 INFO L93 Difference]: Finished difference Result 642 states and 768 transitions. [2019-10-01 22:38:51,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-01 22:38:51,469 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 286 [2019-10-01 22:38:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:38:51,470 INFO L225 Difference]: With dead ends: 642 [2019-10-01 22:38:51,470 INFO L226 Difference]: Without dead ends: 387 [2019-10-01 22:38:51,471 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2175, Invalid=5481, Unknown=0, NotChecked=0, Total=7656 [2019-10-01 22:38:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-10-01 22:38:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-10-01 22:38:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-01 22:38:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 444 transitions. [2019-10-01 22:38:51,483 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 444 transitions. Word has length 286 [2019-10-01 22:38:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:38:51,483 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 444 transitions. [2019-10-01 22:38:51,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-10-01 22:38:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 444 transitions. [2019-10-01 22:38:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-01 22:38:51,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:38:51,486 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 29, 29, 29, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:38:51,486 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:38:51,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:38:51,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1005099723, now seen corresponding path program 53 times [2019-10-01 22:38:51,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:38:51,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:38:51,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:51,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:38:51,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:38:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4821 backedges. 18 proven. 3249 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2019-10-01 22:38:52,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:38:52,900 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 22:38:53,044 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:39:34,523 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2019-10-01 22:39:34,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:39:34,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 22:39:34,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:39:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4821 backedges. 1 proven. 1247 refuted. 0 times theorem prover too weak. 3573 trivial. 0 not checked. [2019-10-01 22:39:35,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:39:35,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 32] total 90 [2019-10-01 22:39:35,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-01 22:39:35,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-01 22:39:35,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2265, Invalid=5745, Unknown=0, NotChecked=0, Total=8010 [2019-10-01 22:39:35,670 INFO L87 Difference]: Start difference. First operand 382 states and 444 transitions. Second operand 90 states. [2019-10-01 22:39:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:39:36,130 INFO L93 Difference]: Finished difference Result 656 states and 786 transitions. [2019-10-01 22:39:36,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-01 22:39:36,135 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 291 [2019-10-01 22:39:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:39:36,137 INFO L225 Difference]: With dead ends: 656 [2019-10-01 22:39:36,137 INFO L226 Difference]: Without dead ends: 395 [2019-10-01 22:39:36,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2265, Invalid=5745, Unknown=0, NotChecked=0, Total=8010 [2019-10-01 22:39:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-01 22:39:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 390. [2019-10-01 22:39:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-10-01 22:39:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 454 transitions. [2019-10-01 22:39:36,157 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 454 transitions. Word has length 291 [2019-10-01 22:39:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:39:36,158 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 454 transitions. [2019-10-01 22:39:36,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-01 22:39:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 454 transitions. [2019-10-01 22:39:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-01 22:39:36,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:39:36,161 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 30, 30, 30, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:39:36,161 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:39:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:39:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash 687358346, now seen corresponding path program 54 times [2019-10-01 22:39:36,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:39:36,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:39:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:39:36,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:39:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:39:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:39:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5024 backedges. 19 proven. 1335 refuted. 0 times theorem prover too weak. 3670 trivial. 0 not checked. [2019-10-01 22:39:36,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:39:36,700 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 22:39:36,850 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE