java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_vararg_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:42:40,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:42:40,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:42:40,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:42:40,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:42:40,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:42:40,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:42:40,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:42:40,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:42:40,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:42:40,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:42:40,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:42:40,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:42:40,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:42:40,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:42:40,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:42:40,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:42:40,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:42:40,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:42:40,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:42:40,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:42:40,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:42:40,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:42:40,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:42:40,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:42:40,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:42:40,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:42:40,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:42:40,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:42:40,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:42:40,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:42:40,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:42:40,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:42:40,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:42:40,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:42:40,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:42:40,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:42:40,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:42:40,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:42:40,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:42:40,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:42:40,122 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 23:42:40,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:42:40,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:42:40,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:42:40,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:42:40,151 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:42:40,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:42:40,151 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:42:40,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:42:40,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:42:40,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:42:40,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:42:40,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:42:40,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:42:40,154 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:42:40,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:42:40,154 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:42:40,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:42:40,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:42:40,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:42:40,155 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:42:40,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:42:40,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:42:40,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:42:40,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:42:40,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:42:40,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:42:40,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:42:40,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:42:40,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:42:40,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:42:40,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:42:40,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:42:40,222 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:42:40,223 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:42:40,224 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_vararg_ground.i [2019-10-01 23:42:40,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175f8fd3d/57b918bf730e4dbd839076527de6a96e/FLAG100904c7d [2019-10-01 23:42:40,751 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:42:40,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_vararg_ground.i [2019-10-01 23:42:40,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175f8fd3d/57b918bf730e4dbd839076527de6a96e/FLAG100904c7d [2019-10-01 23:42:41,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175f8fd3d/57b918bf730e4dbd839076527de6a96e [2019-10-01 23:42:41,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:42:41,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:42:41,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:42:41,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:42:41,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:42:41,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:42:41" (1/1) ... [2019-10-01 23:42:41,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4432024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41, skipping insertion in model container [2019-10-01 23:42:41,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:42:41" (1/1) ... [2019-10-01 23:42:41,189 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:42:41,203 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:42:41,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:42:41,406 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:42:41,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:42:41,537 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:42:41,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41 WrapperNode [2019-10-01 23:42:41,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:42:41,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:42:41,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:42:41,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:42:41,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41" (1/1) ... [2019-10-01 23:42:41,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41" (1/1) ... [2019-10-01 23:42:41,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41" (1/1) ... [2019-10-01 23:42:41,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41" (1/1) ... [2019-10-01 23:42:41,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41" (1/1) ... [2019-10-01 23:42:41,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41" (1/1) ... [2019-10-01 23:42:41,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41" (1/1) ... [2019-10-01 23:42:41,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:42:41,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:42:41,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:42:41,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:42:41,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:42:41,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:42:41,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:42:41,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:42:41,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:42:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:42:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:42:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:42:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:42:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:42:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:42:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:42:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:42:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:42:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:42:41,899 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:42:41,899 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:42:41,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:42:41 BoogieIcfgContainer [2019-10-01 23:42:41,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:42:41,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:42:41,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:42:41,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:42:41,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:42:41" (1/3) ... [2019-10-01 23:42:41,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65285e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:42:41, skipping insertion in model container [2019-10-01 23:42:41,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:42:41" (2/3) ... [2019-10-01 23:42:41,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65285e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:42:41, skipping insertion in model container [2019-10-01 23:42:41,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:42:41" (3/3) ... [2019-10-01 23:42:41,936 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_vararg_ground.i [2019-10-01 23:42:41,966 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:42:41,984 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:42:42,021 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:42:42,061 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:42:42,062 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:42:42,062 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:42:42,063 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:42:42,063 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:42:42,063 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:42:42,063 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:42:42,063 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:42:42,064 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:42:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-01 23:42:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-01 23:42:42,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:42,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:42,088 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:42,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:42,093 INFO L82 PathProgramCache]: Analyzing trace with hash -161951569, now seen corresponding path program 1 times [2019-10-01 23:42:42,095 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:42,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:42,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:42,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:42,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:42,227 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 23:42:42,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:42:42,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:42:42,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:42:42,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:42:42,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:42:42,254 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-10-01 23:42:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:42,287 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-01 23:42:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:42:42,289 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-01 23:42:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:42,302 INFO L225 Difference]: With dead ends: 44 [2019-10-01 23:42:42,302 INFO L226 Difference]: Without dead ends: 21 [2019-10-01 23:42:42,309 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 23:42:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-01 23:42:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-01 23:42:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-01 23:42:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-01 23:42:42,368 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-10-01 23:42:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:42,369 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-01 23:42:42,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:42:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-01 23:42:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:42:42,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:42,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:42,373 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash 932758337, now seen corresponding path program 1 times [2019-10-01 23:42:42,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:42,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:42,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:42,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:42,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:42,511 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 23:42:42,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:42:42,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:42:42,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:42:42,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:42:42,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:42:42,516 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2019-10-01 23:42:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:42,552 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-01 23:42:42,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:42:42,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 23:42:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:42,556 INFO L225 Difference]: With dead ends: 36 [2019-10-01 23:42:42,556 INFO L226 Difference]: Without dead ends: 23 [2019-10-01 23:42:42,558 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 23:42:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-01 23:42:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-01 23:42:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-01 23:42:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-01 23:42:42,570 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-10-01 23:42:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:42,571 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-01 23:42:42,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:42:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-01 23:42:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 23:42:42,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:42,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:42,573 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:42,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1344598495, now seen corresponding path program 1 times [2019-10-01 23:42:42,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:42,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:42,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:42,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:42,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:42:42,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:42,644 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 23:42:42,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:42,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:42:42,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:42:42,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:42,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:42:42,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:42:42,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:42:42,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:42:42,777 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-10-01 23:42:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:42,811 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-10-01 23:42:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:42:42,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-01 23:42:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:42,813 INFO L225 Difference]: With dead ends: 38 [2019-10-01 23:42:42,813 INFO L226 Difference]: Without dead ends: 25 [2019-10-01 23:42:42,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:42:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-01 23:42:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-01 23:42:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 23:42:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-01 23:42:42,820 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-01 23:42:42,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:42,820 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-01 23:42:42,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:42:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-01 23:42:42,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-01 23:42:42,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:42,822 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:42,823 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:42,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:42,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1985999101, now seen corresponding path program 2 times [2019-10-01 23:42:42,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:42,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:42,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:42,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:42,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:42:42,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:42,895 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 23:42:42,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:42:42,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-01 23:42:42,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:42,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:42:42,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 23:42:42,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 23:42:42,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-01 23:42:42,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:42:42,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:42:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:42:42,985 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-10-01 23:42:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:43,101 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-10-01 23:42:43,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:42:43,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-10-01 23:42:43,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:43,104 INFO L225 Difference]: With dead ends: 44 [2019-10-01 23:42:43,105 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 23:42:43,107 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:42:43,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 23:42:43,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 23:42:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 23:42:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-01 23:42:43,120 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-10-01 23:42:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:43,121 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-01 23:42:43,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:42:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-01 23:42:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 23:42:43,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:43,125 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:43,126 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:43,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1184989984, now seen corresponding path program 1 times [2019-10-01 23:42:43,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:43,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:43,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:43,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:43,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:43,255 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 23:42:43,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:43,256 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 23:42:43,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:43,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:42:43,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:43,331 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 23:42:43,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:43,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:42:43,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:42:43,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:42:43,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:42:43,342 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2019-10-01 23:42:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:43,381 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-10-01 23:42:43,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:42:43,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-10-01 23:42:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:43,383 INFO L225 Difference]: With dead ends: 46 [2019-10-01 23:42:43,384 INFO L226 Difference]: Without dead ends: 31 [2019-10-01 23:42:43,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:42:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-01 23:42:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-01 23:42:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-01 23:42:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-01 23:42:43,391 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2019-10-01 23:42:43,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:43,391 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-01 23:42:43,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:42:43,392 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-01 23:42:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 23:42:43,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:43,393 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:43,393 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:43,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:43,394 INFO L82 PathProgramCache]: Analyzing trace with hash -514051138, now seen corresponding path program 2 times [2019-10-01 23:42:43,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:43,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:43,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:43,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:43,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 23:42:43,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:43,513 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 23:42:43,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:42:43,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:42:43,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:43,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:42:43,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 23:42:43,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:43,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:42:43,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:42:43,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:42:43,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:42:43,583 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2019-10-01 23:42:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:43,633 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-10-01 23:42:43,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:42:43,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-10-01 23:42:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:43,636 INFO L225 Difference]: With dead ends: 48 [2019-10-01 23:42:43,636 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 23:42:43,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 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 23:42:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 23:42:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-01 23:42:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 23:42:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-01 23:42:43,643 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2019-10-01 23:42:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:43,643 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-01 23:42:43,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:42:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-01 23:42:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 23:42:43,644 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:43,644 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:43,645 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:43,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:43,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1204996900, now seen corresponding path program 3 times [2019-10-01 23:42:43,645 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:43,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:43,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:43,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:43,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 23:42:43,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:43,733 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 23:42:43,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:43,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 23:42:43,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:43,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:42:43,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:43,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:42:43,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:42:43,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:42:43,888 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 23:42:43,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:42:43,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:42:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 23:42:43,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:43,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-01 23:42:43,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:42:43,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:42:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:42:43,958 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 15 states. [2019-10-01 23:42:44,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:44,265 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-10-01 23:42:44,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:42:44,267 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-10-01 23:42:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:44,269 INFO L225 Difference]: With dead ends: 58 [2019-10-01 23:42:44,269 INFO L226 Difference]: Without dead ends: 43 [2019-10-01 23:42:44,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:42:44,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-01 23:42:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-10-01 23:42:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-01 23:42:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-10-01 23:42:44,288 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 27 [2019-10-01 23:42:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:44,289 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-10-01 23:42:44,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:42:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-10-01 23:42:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 23:42:44,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:44,293 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:44,293 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:44,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:44,294 INFO L82 PathProgramCache]: Analyzing trace with hash -116499279, now seen corresponding path program 1 times [2019-10-01 23:42:44,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:44,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:44,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:44,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 23:42:44,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:44,449 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 23:42:44,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:44,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:42:44,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 23:42:44,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:44,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-10-01 23:42:44,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:42:44,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:42:44,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:42:44,620 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 13 states. [2019-10-01 23:42:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:44,800 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-10-01 23:42:44,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:42:44,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-10-01 23:42:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:44,807 INFO L225 Difference]: With dead ends: 72 [2019-10-01 23:42:44,807 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 23:42:44,808 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:42:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 23:42:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-01 23:42:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 23:42:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-10-01 23:42:44,820 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2019-10-01 23:42:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:44,820 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-10-01 23:42:44,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:42:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-10-01 23:42:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 23:42:44,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:44,822 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:44,822 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash 601056020, now seen corresponding path program 2 times [2019-10-01 23:42:44,822 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:44,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:44,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 23:42:44,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:44,928 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:44,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:42:44,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:42:44,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:44,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:42:44,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 23:42:45,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:45,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:42:45,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:42:45,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:42:45,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:42:45,020 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 11 states. [2019-10-01 23:42:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:45,067 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-10-01 23:42:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:42:45,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-10-01 23:42:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:45,068 INFO L225 Difference]: With dead ends: 70 [2019-10-01 23:42:45,068 INFO L226 Difference]: Without dead ends: 47 [2019-10-01 23:42:45,069 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 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 23:42:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-01 23:42:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-01 23:42:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 23:42:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-10-01 23:42:45,076 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 41 [2019-10-01 23:42:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:45,077 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-10-01 23:42:45,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:42:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-10-01 23:42:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 23:42:45,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:45,078 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:45,078 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1449814066, now seen corresponding path program 3 times [2019-10-01 23:42:45,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:45,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:45,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:45,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:45,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 23:42:45,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:45,182 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 23:42:45,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:45,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:42:45,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:45,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:42:45,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:45,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:42:45,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:42:45,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:42:45,456 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 23:42:45,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:42:45,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:42:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 23:42:45,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:45,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2019-10-01 23:42:45,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:42:45,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:42:45,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:42:45,517 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 23 states. [2019-10-01 23:42:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:52,298 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2019-10-01 23:42:52,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:42:52,299 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-10-01 23:42:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:52,300 INFO L225 Difference]: With dead ends: 82 [2019-10-01 23:42:52,300 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 23:42:52,302 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:42:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 23:42:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-10-01 23:42:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-01 23:42:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-10-01 23:42:52,310 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 43 [2019-10-01 23:42:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:52,310 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-10-01 23:42:52,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:42:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-10-01 23:42:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 23:42:52,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:52,312 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:52,312 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:52,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:52,313 INFO L82 PathProgramCache]: Analyzing trace with hash -361308665, now seen corresponding path program 4 times [2019-10-01 23:42:52,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:52,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:52,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:52,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:52,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 23:42:52,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:52,454 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:52,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:42:52,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:42:52,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:52,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:42:52,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-01 23:42:52,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:52,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:42:52,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:42:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:42:52,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:42:52,572 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 13 states. [2019-10-01 23:42:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:52,614 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-10-01 23:42:52,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:42:52,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-10-01 23:42:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:52,616 INFO L225 Difference]: With dead ends: 90 [2019-10-01 23:42:52,616 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 23:42:52,617 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:42:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 23:42:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-10-01 23:42:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 23:42:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-01 23:42:52,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 53 [2019-10-01 23:42:52,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:52,625 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-01 23:42:52,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:42:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-01 23:42:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 23:42:52,626 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:52,627 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:52,627 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:52,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:52,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1963533861, now seen corresponding path program 5 times [2019-10-01 23:42:52,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:52,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:52,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:52,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:52,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 4 proven. 100 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 23:42:52,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:52,791 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 23:42:52,820 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:42:52,902 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 23:42:52,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:52,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:42:52,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-01 23:42:52,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:52,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:42:52,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:42:52,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:42:52,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:42:52,938 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 14 states. [2019-10-01 23:42:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:52,997 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2019-10-01 23:42:52,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:42:52,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-01 23:42:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:52,999 INFO L225 Difference]: With dead ends: 92 [2019-10-01 23:42:52,999 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 23:42:53,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 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 23:42:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 23:42:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-01 23:42:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-01 23:42:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-01 23:42:53,008 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2019-10-01 23:42:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:53,009 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-01 23:42:53,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:42:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-01 23:42:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 23:42:53,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:53,010 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:53,010 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1540759869, now seen corresponding path program 6 times [2019-10-01 23:42:53,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:53,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:53,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:53,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:53,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 4 proven. 121 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 23:42:53,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:53,144 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 23:42:53,183 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:42:53,213 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 23:42:53,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:53,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:42:53,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:42:53,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:53,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2019-10-01 23:42:53,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:42:53,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:42:53,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:42:53,325 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 20 states. [2019-10-01 23:42:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:53,645 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-10-01 23:42:53,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:42:53,646 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2019-10-01 23:42:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:53,647 INFO L225 Difference]: With dead ends: 106 [2019-10-01 23:42:53,647 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 23:42:53,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=316, Invalid=676, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:42:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 23:42:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-10-01 23:42:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-01 23:42:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-10-01 23:42:53,656 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2019-10-01 23:42:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:53,657 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-10-01 23:42:53,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:42:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-10-01 23:42:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-01 23:42:53,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:53,658 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:53,658 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:53,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:53,659 INFO L82 PathProgramCache]: Analyzing trace with hash -962885018, now seen corresponding path program 7 times [2019-10-01 23:42:53,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:53,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:53,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:53,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:53,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 4 proven. 144 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:42:53,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:53,796 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 23:42:53,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:53,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:42:53,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 23:42:53,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:53,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:42:53,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:42:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:42:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:42:53,884 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 16 states. [2019-10-01 23:42:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:53,953 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-10-01 23:42:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:42:53,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2019-10-01 23:42:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:53,958 INFO L225 Difference]: With dead ends: 100 [2019-10-01 23:42:53,958 INFO L226 Difference]: Without dead ends: 67 [2019-10-01 23:42:53,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:42:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-01 23:42:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-10-01 23:42:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-01 23:42:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-10-01 23:42:53,976 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 61 [2019-10-01 23:42:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:53,977 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-10-01 23:42:53,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:42:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-10-01 23:42:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 23:42:53,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:53,981 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:53,981 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:53,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:53,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1047188612, now seen corresponding path program 8 times [2019-10-01 23:42:53,982 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:53,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:53,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 4 proven. 169 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:42:54,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:54,201 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 23:42:54,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:42:54,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:42:54,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:54,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:42:54,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 23:42:54,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:54,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:42:54,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:42:54,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:42:54,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:42:54,337 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 17 states. [2019-10-01 23:42:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:54,408 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2019-10-01 23:42:54,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:42:54,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2019-10-01 23:42:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:54,410 INFO L225 Difference]: With dead ends: 102 [2019-10-01 23:42:54,410 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 23:42:54,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 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 23:42:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 23:42:54,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-10-01 23:42:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 23:42:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-10-01 23:42:54,417 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2019-10-01 23:42:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:54,418 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-10-01 23:42:54,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:42:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-10-01 23:42:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 23:42:54,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:54,422 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:54,422 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash -7336158, now seen corresponding path program 9 times [2019-10-01 23:42:54,423 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:54,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:54,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:54,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:54,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 4 proven. 196 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:42:54,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:54,647 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 23:42:54,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:42:54,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 23:42:54,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:54,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:42:54,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:55,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:42:55,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:42:55,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:42:55,022 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 23:42:55,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:42:55,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:42:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-10-01 23:42:55,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:55,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-10-01 23:42:55,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:42:55,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:42:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:42:55,111 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 31 states. [2019-10-01 23:43:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:02,153 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2019-10-01 23:43:02,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:43:02,153 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 65 [2019-10-01 23:43:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:02,155 INFO L225 Difference]: With dead ends: 114 [2019-10-01 23:43:02,155 INFO L226 Difference]: Without dead ends: 81 [2019-10-01 23:43:02,156 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=492, Invalid=2370, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 23:43:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-01 23:43:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2019-10-01 23:43:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-01 23:43:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-10-01 23:43:02,165 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2019-10-01 23:43:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:02,166 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-10-01 23:43:02,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:43:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-10-01 23:43:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 23:43:02,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:02,167 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:02,167 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:02,168 INFO L82 PathProgramCache]: Analyzing trace with hash -14161289, now seen corresponding path program 10 times [2019-10-01 23:43:02,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:02,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:02,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:02,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:02,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 6 proven. 225 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-01 23:43:02,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:02,362 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 23:43:02,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:43:02,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:43:02,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:02,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:43:02,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-01 23:43:02,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:02,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:43:02,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:43:02,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:43:02,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:43:02,455 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 19 states. [2019-10-01 23:43:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:02,537 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2019-10-01 23:43:02,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:43:02,538 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-10-01 23:43:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:02,539 INFO L225 Difference]: With dead ends: 122 [2019-10-01 23:43:02,539 INFO L226 Difference]: Without dead ends: 81 [2019-10-01 23:43:02,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 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 23:43:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-01 23:43:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-10-01 23:43:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-01 23:43:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-10-01 23:43:02,550 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 75 [2019-10-01 23:43:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:02,550 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-10-01 23:43:02,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:43:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-10-01 23:43:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-01 23:43:02,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:02,552 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:02,553 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:02,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:02,553 INFO L82 PathProgramCache]: Analyzing trace with hash 354691093, now seen corresponding path program 11 times [2019-10-01 23:43:02,553 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:02,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:02,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:02,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:02,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-01 23:43:02,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:02,664 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 23:43:02,688 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:43:02,872 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 23:43:02,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:02,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:43:02,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:43:03,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:03,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 27 [2019-10-01 23:43:03,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:43:03,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:43:03,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:43:03,105 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 27 states. [2019-10-01 23:43:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:03,561 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2019-10-01 23:43:03,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:43:03,562 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 77 [2019-10-01 23:43:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:03,563 INFO L225 Difference]: With dead ends: 140 [2019-10-01 23:43:03,563 INFO L226 Difference]: Without dead ends: 85 [2019-10-01 23:43:03,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=606, Invalid=1556, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:43:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-01 23:43:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-10-01 23:43:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-01 23:43:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-10-01 23:43:03,572 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 77 [2019-10-01 23:43:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:03,572 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-10-01 23:43:03,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:43:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-10-01 23:43:03,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-01 23:43:03,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:03,574 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:03,574 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:03,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:03,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1846515464, now seen corresponding path program 12 times [2019-10-01 23:43:03,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:03,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:03,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:03,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:03,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 6 proven. 289 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-01 23:43:03,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:03,807 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 23:43:03,833 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:43:03,884 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 23:43:03,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:03,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:43:03,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:04,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:43:04,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:43:04,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:43:04,324 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 23:43:04,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:43:04,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:43:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-10-01 23:43:04,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:04,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2019-10-01 23:43:04,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:43:04,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:43:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:43:04,398 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 36 states. [2019-10-01 23:43:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:09,870 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2019-10-01 23:43:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:43:09,870 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2019-10-01 23:43:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:09,872 INFO L225 Difference]: With dead ends: 140 [2019-10-01 23:43:09,872 INFO L226 Difference]: Without dead ends: 97 [2019-10-01 23:43:09,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=667, Invalid=3239, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 23:43:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-01 23:43:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2019-10-01 23:43:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-01 23:43:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-10-01 23:43:09,885 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 81 [2019-10-01 23:43:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:09,886 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-10-01 23:43:09,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:43:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-10-01 23:43:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-01 23:43:09,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:09,888 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:09,888 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1954409907, now seen corresponding path program 13 times [2019-10-01 23:43:09,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:09,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:09,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:09,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 8 proven. 324 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-01 23:43:10,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:10,221 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 23:43:10,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:43:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:10,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:43:10,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-01 23:43:10,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:10,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:43:10,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:43:10,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:43:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:43:10,360 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 22 states. [2019-10-01 23:43:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:10,430 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2019-10-01 23:43:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:43:10,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 91 [2019-10-01 23:43:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:10,432 INFO L225 Difference]: With dead ends: 148 [2019-10-01 23:43:10,432 INFO L226 Difference]: Without dead ends: 97 [2019-10-01 23:43:10,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:43:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-01 23:43:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-10-01 23:43:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-01 23:43:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-10-01 23:43:10,439 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 91 [2019-10-01 23:43:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:10,440 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-10-01 23:43:10,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:43:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-10-01 23:43:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-01 23:43:10,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:10,441 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:10,441 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:10,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1815827435, now seen corresponding path program 14 times [2019-10-01 23:43:10,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:10,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:10,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:10,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:43:10,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 8 proven. 361 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-01 23:43:10,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:10,703 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 23:43:10,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:43:10,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:43:10,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:10,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:43:10,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-01 23:43:10,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:10,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:43:10,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:43:10,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:43:10,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:43:10,811 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 23 states. [2019-10-01 23:43:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:10,877 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-10-01 23:43:10,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:43:10,878 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 93 [2019-10-01 23:43:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:10,880 INFO L225 Difference]: With dead ends: 150 [2019-10-01 23:43:10,880 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 23:43:10,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 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 23:43:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 23:43:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-10-01 23:43:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-01 23:43:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-10-01 23:43:10,893 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-10-01 23:43:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:10,894 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-10-01 23:43:10,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:43:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-10-01 23:43:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 23:43:10,895 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:10,895 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:10,896 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:10,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:10,896 INFO L82 PathProgramCache]: Analyzing trace with hash 61515273, now seen corresponding path program 15 times [2019-10-01 23:43:10,896 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:10,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:10,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:10,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 8 proven. 400 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-01 23:43:11,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:11,282 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 23:43:11,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:43:11,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-01 23:43:11,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:11,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:43:11,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2019-10-01 23:43:11,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:11,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12] total 33 [2019-10-01 23:43:11,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:43:11,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:43:11,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:43:11,625 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 33 states. [2019-10-01 23:43:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:12,130 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2019-10-01 23:43:12,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:43:12,132 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 95 [2019-10-01 23:43:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:12,133 INFO L225 Difference]: With dead ends: 172 [2019-10-01 23:43:12,133 INFO L226 Difference]: Without dead ends: 103 [2019-10-01 23:43:12,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=886, Invalid=1976, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 23:43:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-01 23:43:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-10-01 23:43:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 23:43:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-10-01 23:43:12,142 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 95 [2019-10-01 23:43:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:12,142 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-10-01 23:43:12,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:43:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-10-01 23:43:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 23:43:12,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:12,144 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:12,144 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:12,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1456597804, now seen corresponding path program 16 times [2019-10-01 23:43:12,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:12,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:12,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:12,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:12,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 8 proven. 441 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-01 23:43:12,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:12,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 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 23:43:12,424 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:43:12,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:43:12,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:12,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:43:12,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:43:12,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:12,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:43:12,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:43:12,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:43:12,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:43:12,500 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 25 states. [2019-10-01 23:43:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:12,603 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2019-10-01 23:43:12,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:43:12,603 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2019-10-01 23:43:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:12,605 INFO L225 Difference]: With dead ends: 158 [2019-10-01 23:43:12,605 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 23:43:12,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:43:12,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 23:43:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-10-01 23:43:12,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-01 23:43:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-10-01 23:43:12,612 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 99 [2019-10-01 23:43:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:12,612 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-10-01 23:43:12,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:43:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-10-01 23:43:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-01 23:43:12,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:12,614 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:12,614 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1358343882, now seen corresponding path program 17 times [2019-10-01 23:43:12,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:12,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:12,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 8 proven. 484 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-01 23:43:12,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:12,897 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 23:43:12,931 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:43:13,514 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 23:43:13,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:13,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:43:13,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:43:13,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:13,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:43:13,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:43:13,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:43:13,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:43:13,558 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 26 states. [2019-10-01 23:43:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:13,653 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2019-10-01 23:43:13,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:43:13,653 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 101 [2019-10-01 23:43:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:13,655 INFO L225 Difference]: With dead ends: 160 [2019-10-01 23:43:13,655 INFO L226 Difference]: Without dead ends: 107 [2019-10-01 23:43:13,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 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 23:43:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-01 23:43:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-10-01 23:43:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-01 23:43:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-10-01 23:43:13,662 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 101 [2019-10-01 23:43:13,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:13,662 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-10-01 23:43:13,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:43:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-10-01 23:43:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 23:43:13,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:13,663 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:13,664 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:13,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1425605352, now seen corresponding path program 18 times [2019-10-01 23:43:13,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:13,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:13,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:13,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:13,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 8 proven. 529 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-01 23:43:13,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:13,973 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 23:43:14,009 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:43:14,088 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 23:43:14,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:14,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:43:14,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:14,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:43:14,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:43:14,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:43:14,683 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 23:43:14,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:43:14,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:43:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 9 proven. 70 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-01 23:43:14,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:14,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 44 [2019-10-01 23:43:14,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 23:43:14,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 23:43:14,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1518, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:43:14,797 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 44 states. [2019-10-01 23:43:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:24,329 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2019-10-01 23:43:24,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 23:43:24,330 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 103 [2019-10-01 23:43:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:24,331 INFO L225 Difference]: With dead ends: 172 [2019-10-01 23:43:24,331 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 23:43:24,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1085, Invalid=4921, Unknown=0, NotChecked=0, Total=6006 [2019-10-01 23:43:24,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 23:43:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-10-01 23:43:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-01 23:43:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-10-01 23:43:24,340 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 103 [2019-10-01 23:43:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:24,341 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-10-01 23:43:24,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 23:43:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-10-01 23:43:24,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-01 23:43:24,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:24,342 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:24,342 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:24,343 INFO L82 PathProgramCache]: Analyzing trace with hash -381226563, now seen corresponding path program 19 times [2019-10-01 23:43:24,343 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:24,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:24,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:24,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:24,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 10 proven. 576 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-01 23:43:24,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:24,844 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 23:43:24,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:43:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:24,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:43:24,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-01 23:43:25,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:25,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:43:25,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:43:25,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:43:25,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:43:25,006 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 28 states. [2019-10-01 23:43:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:25,102 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-10-01 23:43:25,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:43:25,103 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 113 [2019-10-01 23:43:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:25,104 INFO L225 Difference]: With dead ends: 180 [2019-10-01 23:43:25,104 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 23:43:25,105 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:43:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 23:43:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-10-01 23:43:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-01 23:43:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2019-10-01 23:43:25,111 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 113 [2019-10-01 23:43:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:25,111 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2019-10-01 23:43:25,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:43:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2019-10-01 23:43:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-01 23:43:25,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:25,113 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:25,113 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:25,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash -339343141, now seen corresponding path program 20 times [2019-10-01 23:43:25,114 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:25,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:25,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:25,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:43:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 10 proven. 625 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-01 23:43:25,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:25,461 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 23:43:25,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:43:25,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:43:25,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:25,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:43:25,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 130 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 23:43:25,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:25,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:43:25,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:43:25,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:43:25,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:43:25,584 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 29 states. [2019-10-01 23:43:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:25,686 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2019-10-01 23:43:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:43:25,686 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2019-10-01 23:43:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:25,687 INFO L225 Difference]: With dead ends: 182 [2019-10-01 23:43:25,687 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 23:43:25,688 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:43:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 23:43:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-10-01 23:43:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-01 23:43:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-10-01 23:43:25,695 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 115 [2019-10-01 23:43:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:25,696 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-10-01 23:43:25,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:43:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-10-01 23:43:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 23:43:25,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:25,697 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:25,697 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1255919737, now seen corresponding path program 21 times [2019-10-01 23:43:25,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:25,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:25,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:25,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:25,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 10 proven. 676 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-01 23:43:26,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:26,091 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 23:43:26,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:43:26,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:43:26,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:26,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:43:26,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-10-01 23:43:26,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:26,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 14] total 41 [2019-10-01 23:43:26,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:43:26,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:43:26,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1174, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:43:26,480 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 41 states. [2019-10-01 23:43:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:27,286 INFO L93 Difference]: Finished difference Result 208 states and 218 transitions. [2019-10-01 23:43:27,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:43:27,290 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 117 [2019-10-01 23:43:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:27,291 INFO L225 Difference]: With dead ends: 208 [2019-10-01 23:43:27,291 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 23:43:27,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1411, Invalid=3145, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:43:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 23:43:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-10-01 23:43:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-01 23:43:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-10-01 23:43:27,309 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 117 [2019-10-01 23:43:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:27,309 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-10-01 23:43:27,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:43:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-10-01 23:43:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-01 23:43:27,311 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:27,311 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:27,311 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:27,311 INFO L82 PathProgramCache]: Analyzing trace with hash -977859620, now seen corresponding path program 22 times [2019-10-01 23:43:27,312 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:27,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:27,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:27,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:27,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 10 proven. 729 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-01 23:43:27,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:27,732 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 23:43:27,777 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:43:27,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:43:27,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:27,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:43:27,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:43:27,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:27,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:43:27,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:43:27,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:43:27,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:43:27,888 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 31 states. [2019-10-01 23:43:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:27,994 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2019-10-01 23:43:27,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:43:27,995 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2019-10-01 23:43:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:27,996 INFO L225 Difference]: With dead ends: 190 [2019-10-01 23:43:27,996 INFO L226 Difference]: Without dead ends: 127 [2019-10-01 23:43:27,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 121 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 23:43:27,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-01 23:43:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-10-01 23:43:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-01 23:43:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-10-01 23:43:28,003 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 121 [2019-10-01 23:43:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:28,004 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-10-01 23:43:28,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:43:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-10-01 23:43:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-01 23:43:28,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:28,005 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:28,005 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1597252858, now seen corresponding path program 23 times [2019-10-01 23:43:28,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:28,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:28,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:28,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 10 proven. 784 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-01 23:43:28,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:28,927 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 23:43:28,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:43:29,623 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 23:43:29,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:29,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:43:29,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-01 23:43:29,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:29,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:43:29,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:43:29,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:43:29,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:43:29,662 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 32 states. [2019-10-01 23:43:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:29,748 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2019-10-01 23:43:29,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:43:29,750 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 123 [2019-10-01 23:43:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:29,751 INFO L225 Difference]: With dead ends: 192 [2019-10-01 23:43:29,751 INFO L226 Difference]: Without dead ends: 129 [2019-10-01 23:43:29,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:43:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-01 23:43:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-10-01 23:43:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-01 23:43:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-10-01 23:43:29,761 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 123 [2019-10-01 23:43:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:29,761 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-10-01 23:43:29,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:43:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-10-01 23:43:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-01 23:43:29,763 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:29,763 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:29,763 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:29,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:29,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1915785576, now seen corresponding path program 24 times [2019-10-01 23:43:29,764 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:29,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:29,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:29,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:29,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 10 proven. 841 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-01 23:43:30,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:30,336 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 23:43:30,416 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:43:30,605 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:43:30,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:30,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:43:30,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:31,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:43:31,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:43:31,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:43:31,700 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 23:43:31,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:43:31,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:43:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 12 proven. 102 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2019-10-01 23:43:31,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:31,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 22] total 52 [2019-10-01 23:43:31,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 23:43:31,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 23:43:31,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=2101, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 23:43:31,835 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 52 states. [2019-10-01 23:43:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:42,536 INFO L93 Difference]: Finished difference Result 204 states and 209 transitions. [2019-10-01 23:43:42,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 23:43:42,536 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 125 [2019-10-01 23:43:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:42,537 INFO L225 Difference]: With dead ends: 204 [2019-10-01 23:43:42,538 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 23:43:42,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2014 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1611, Invalid=6945, Unknown=0, NotChecked=0, Total=8556 [2019-10-01 23:43:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 23:43:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2019-10-01 23:43:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-01 23:43:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-10-01 23:43:42,549 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 125 [2019-10-01 23:43:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:42,549 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-10-01 23:43:42,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 23:43:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-10-01 23:43:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-01 23:43:42,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:42,550 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:42,551 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:42,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:42,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1819098387, now seen corresponding path program 25 times [2019-10-01 23:43:42,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:42,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:42,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 12 proven. 900 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-01 23:43:43,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:43,123 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 23:43:43,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:43:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:43,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:43:43,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-10-01 23:43:43,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:43,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 23:43:43,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:43:43,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:43:43,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:43:43,292 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 34 states. [2019-10-01 23:43:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:43,402 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2019-10-01 23:43:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:43:43,403 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2019-10-01 23:43:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:43,404 INFO L225 Difference]: With dead ends: 212 [2019-10-01 23:43:43,404 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 23:43:43,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:43:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 23:43:43,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-10-01 23:43:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-01 23:43:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-10-01 23:43:43,417 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 135 [2019-10-01 23:43:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:43,418 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-10-01 23:43:43,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:43:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-10-01 23:43:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-01 23:43:43,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:43,419 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:43,419 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:43,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:43,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1130794891, now seen corresponding path program 26 times [2019-10-01 23:43:43,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:43,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:43,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:43,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:43:43,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 12 proven. 961 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-01 23:43:43,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:43,907 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 23:43:43,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:43:44,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:43:44,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:44,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:43:44,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-10-01 23:43:44,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:44,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 23:43:44,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:43:44,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:43:44,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:43:44,082 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 35 states. [2019-10-01 23:43:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:44,226 INFO L93 Difference]: Finished difference Result 214 states and 218 transitions. [2019-10-01 23:43:44,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:43:44,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 137 [2019-10-01 23:43:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:44,228 INFO L225 Difference]: With dead ends: 214 [2019-10-01 23:43:44,229 INFO L226 Difference]: Without dead ends: 143 [2019-10-01 23:43:44,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:43:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-01 23:43:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-10-01 23:43:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-01 23:43:44,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-10-01 23:43:44,239 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 137 [2019-10-01 23:43:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:44,239 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-10-01 23:43:44,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:43:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-10-01 23:43:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-01 23:43:44,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:44,241 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:44,241 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:44,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1299819689, now seen corresponding path program 27 times [2019-10-01 23:43:44,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:44,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:44,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:44,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:44,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 12 proven. 1024 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-01 23:43:45,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:45,060 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 23:43:45,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:43:45,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 23:43:45,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:45,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:43:45,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 84 proven. 42 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2019-10-01 23:43:45,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:45,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 16] total 49 [2019-10-01 23:43:45,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 23:43:45,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 23:43:45,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1680, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:43:45,584 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 49 states. [2019-10-01 23:43:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:46,811 INFO L93 Difference]: Finished difference Result 244 states and 255 transitions. [2019-10-01 23:43:46,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 23:43:46,811 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 139 [2019-10-01 23:43:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:46,813 INFO L225 Difference]: With dead ends: 244 [2019-10-01 23:43:46,813 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 23:43:46,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2058, Invalid=4584, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 23:43:46,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 23:43:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-10-01 23:43:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-01 23:43:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-10-01 23:43:46,822 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 139 [2019-10-01 23:43:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:46,823 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-10-01 23:43:46,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 23:43:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-10-01 23:43:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-01 23:43:46,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:46,824 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:46,824 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1593937484, now seen corresponding path program 28 times [2019-10-01 23:43:46,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:46,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:46,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:46,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:46,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 12 proven. 1089 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-01 23:43:47,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:47,449 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 23:43:47,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:43:47,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:43:47,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:47,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:43:47,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:43:47,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:47,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 23:43:47,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 23:43:47,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 23:43:47,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:43:47,674 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 37 states. [2019-10-01 23:43:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:47,840 INFO L93 Difference]: Finished difference Result 222 states and 226 transitions. [2019-10-01 23:43:47,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:43:47,841 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 143 [2019-10-01 23:43:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:47,842 INFO L225 Difference]: With dead ends: 222 [2019-10-01 23:43:47,842 INFO L226 Difference]: Without dead ends: 149 [2019-10-01 23:43:47,843 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:43:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-01 23:43:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-10-01 23:43:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-01 23:43:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2019-10-01 23:43:47,857 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 143 [2019-10-01 23:43:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:47,857 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2019-10-01 23:43:47,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 23:43:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2019-10-01 23:43:47,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-01 23:43:47,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:47,859 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:47,859 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:47,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:47,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1769612054, now seen corresponding path program 29 times [2019-10-01 23:43:47,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:47,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:47,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:47,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 12 proven. 1156 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-01 23:43:48,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:48,469 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 23:43:48,543 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:43:55,920 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 23:43:55,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:55,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:43:55,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-01 23:43:55,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:55,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 23:43:55,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:43:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:43:55,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:43:55,967 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 38 states. [2019-10-01 23:43:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:56,075 INFO L93 Difference]: Finished difference Result 224 states and 228 transitions. [2019-10-01 23:43:56,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 23:43:56,079 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 145 [2019-10-01 23:43:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:56,080 INFO L225 Difference]: With dead ends: 224 [2019-10-01 23:43:56,080 INFO L226 Difference]: Without dead ends: 151 [2019-10-01 23:43:56,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:43:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-01 23:43:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-10-01 23:43:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-01 23:43:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-10-01 23:43:56,089 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 145 [2019-10-01 23:43:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:56,089 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-10-01 23:43:56,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:43:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-10-01 23:43:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 23:43:56,091 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:56,091 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:56,091 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:56,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:56,092 INFO L82 PathProgramCache]: Analyzing trace with hash -30344184, now seen corresponding path program 30 times [2019-10-01 23:43:56,093 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:56,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:56,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 12 proven. 1225 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-01 23:43:56,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:56,687 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 23:43:56,749 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:43:56,969 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 23:43:56,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:56,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 23:43:56,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:58,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:43:58,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:43:58,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:43:58,205 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 23:43:58,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:43:58,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:43:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 15 proven. 140 refuted. 0 times theorem prover too weak. 1270 trivial. 0 not checked. [2019-10-01 23:43:58,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:58,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 24] total 60 [2019-10-01 23:43:58,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 23:43:58,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 23:43:58,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=764, Invalid=2776, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 23:43:58,397 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 60 states. [2019-10-01 23:44:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:07,674 INFO L93 Difference]: Finished difference Result 236 states and 241 transitions. [2019-10-01 23:44:07,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 23:44:07,674 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 147 [2019-10-01 23:44:07,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:07,676 INFO L225 Difference]: With dead ends: 236 [2019-10-01 23:44:07,676 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 23:44:07,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 115 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2745 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2245, Invalid=9311, Unknown=0, NotChecked=0, Total=11556 [2019-10-01 23:44:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 23:44:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2019-10-01 23:44:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-01 23:44:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2019-10-01 23:44:07,683 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 147 [2019-10-01 23:44:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:07,684 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2019-10-01 23:44:07,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 23:44:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2019-10-01 23:44:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-01 23:44:07,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:07,685 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:07,685 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:07,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:07,686 INFO L82 PathProgramCache]: Analyzing trace with hash -815082019, now seen corresponding path program 31 times [2019-10-01 23:44:07,686 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:07,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:07,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:07,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:07,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 87 proven. 81 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2019-10-01 23:44:07,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:07,892 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 23:44:07,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:08,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 23:44:08,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-10-01 23:44:08,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:08,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 39] total 55 [2019-10-01 23:44:08,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 23:44:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 23:44:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=2147, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 23:44:08,862 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 55 states. [2019-10-01 23:44:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:10,250 INFO L93 Difference]: Finished difference Result 276 states and 288 transitions. [2019-10-01 23:44:10,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 23:44:10,255 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 157 [2019-10-01 23:44:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:10,256 INFO L225 Difference]: With dead ends: 276 [2019-10-01 23:44:10,256 INFO L226 Difference]: Without dead ends: 165 [2019-10-01 23:44:10,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1743 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2632, Invalid=7070, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 23:44:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-01 23:44:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-10-01 23:44:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-01 23:44:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-10-01 23:44:10,267 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 157 [2019-10-01 23:44:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:10,267 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-10-01 23:44:10,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 23:44:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-10-01 23:44:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-01 23:44:10,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:10,269 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:10,269 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:10,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash -587412544, now seen corresponding path program 32 times [2019-10-01 23:44:10,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:10,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:10,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:10,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:10,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 14 proven. 1369 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-10-01 23:44:10,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:10,915 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 23:44:10,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:44:11,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:44:11,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:11,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:44:11,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-01 23:44:11,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:11,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 23:44:11,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:44:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:44:11,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:44:11,102 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 41 states. [2019-10-01 23:44:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:11,238 INFO L93 Difference]: Finished difference Result 250 states and 254 transitions. [2019-10-01 23:44:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:44:11,238 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 161 [2019-10-01 23:44:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:11,239 INFO L225 Difference]: With dead ends: 250 [2019-10-01 23:44:11,239 INFO L226 Difference]: Without dead ends: 167 [2019-10-01 23:44:11,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:44:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-01 23:44:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-10-01 23:44:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-01 23:44:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2019-10-01 23:44:11,248 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 161 [2019-10-01 23:44:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:11,249 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2019-10-01 23:44:11,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:44:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2019-10-01 23:44:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-01 23:44:11,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:11,250 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:11,250 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1804472610, now seen corresponding path program 33 times [2019-10-01 23:44:11,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:11,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:11,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:11,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1712 backedges. 14 proven. 1444 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-10-01 23:44:12,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:12,136 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:44:12,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:44:12,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:44:12,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:12,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 23:44:12,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:13,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:44:13,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:44:13,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:44:13,561 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 23:44:13,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:44:13,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:44:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1712 backedges. 18 proven. 184 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-10-01 23:44:13,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:13,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 26] total 65 [2019-10-01 23:44:13,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 23:44:13,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 23:44:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=887, Invalid=3273, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 23:44:13,715 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 65 states. [2019-10-01 23:44:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:25,451 INFO L93 Difference]: Finished difference Result 262 states and 267 transitions. [2019-10-01 23:44:25,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 23:44:25,451 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 163 [2019-10-01 23:44:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:25,453 INFO L225 Difference]: With dead ends: 262 [2019-10-01 23:44:25,453 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 23:44:25,454 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 127 SyntacticMatches, 13 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3287 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2609, Invalid=10963, Unknown=0, NotChecked=0, Total=13572 [2019-10-01 23:44:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 23:44:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-10-01 23:44:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-01 23:44:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2019-10-01 23:44:25,463 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 163 [2019-10-01 23:44:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:25,463 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2019-10-01 23:44:25,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 23:44:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2019-10-01 23:44:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-01 23:44:25,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:25,465 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:25,465 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash -169634125, now seen corresponding path program 34 times [2019-10-01 23:44:25,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:25,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:25,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:25,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:25,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 115 proven. 101 refuted. 0 times theorem prover too weak. 1633 trivial. 0 not checked. [2019-10-01 23:44:25,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:25,683 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 23:44:25,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:44:25,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:44:25,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:25,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 23:44:25,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-10-01 23:44:26,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:26,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 42] total 60 [2019-10-01 23:44:26,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 23:44:26,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 23:44:26,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=962, Invalid=2578, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 23:44:26,822 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 60 states. [2019-10-01 23:44:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:28,458 INFO L93 Difference]: Finished difference Result 306 states and 319 transitions. [2019-10-01 23:44:28,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 23:44:28,458 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 173 [2019-10-01 23:44:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:28,460 INFO L225 Difference]: With dead ends: 306 [2019-10-01 23:44:28,460 INFO L226 Difference]: Without dead ends: 181 [2019-10-01 23:44:28,461 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3090, Invalid=8466, Unknown=0, NotChecked=0, Total=11556 [2019-10-01 23:44:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-01 23:44:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-10-01 23:44:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-01 23:44:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2019-10-01 23:44:28,471 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 173 [2019-10-01 23:44:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:28,471 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2019-10-01 23:44:28,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 23:44:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2019-10-01 23:44:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-01 23:44:28,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:28,473 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:28,473 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:28,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:28,473 INFO L82 PathProgramCache]: Analyzing trace with hash 482774998, now seen corresponding path program 35 times [2019-10-01 23:44:28,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:28,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:28,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 16 proven. 1600 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-01 23:44:29,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:29,180 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 23:44:29,264 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:44:37,784 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 23:44:37,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:37,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:44:37,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:44:37,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:37,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 23:44:37,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 23:44:37,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 23:44:37,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:44:37,888 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 44 states. [2019-10-01 23:44:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:38,040 INFO L93 Difference]: Finished difference Result 276 states and 280 transitions. [2019-10-01 23:44:38,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 23:44:38,040 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 177 [2019-10-01 23:44:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:38,042 INFO L225 Difference]: With dead ends: 276 [2019-10-01 23:44:38,042 INFO L226 Difference]: Without dead ends: 183 [2019-10-01 23:44:38,043 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:44:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-01 23:44:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-10-01 23:44:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-01 23:44:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-10-01 23:44:38,057 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-10-01 23:44:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:38,057 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-10-01 23:44:38,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 23:44:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-10-01 23:44:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-01 23:44:38,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:38,059 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:38,059 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash -142756108, now seen corresponding path program 36 times [2019-10-01 23:44:38,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:38,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:38,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:38,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:38,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 16 proven. 1681 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-01 23:44:39,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:39,064 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 23:44:39,148 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:44:40,015 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:44:40,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:40,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 23:44:40,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:41,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:44:41,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:44:41,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:44:41,501 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 23:44:41,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:44:41,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:44:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 1793 trivial. 0 not checked. [2019-10-01 23:44:41,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:41,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 26] total 68 [2019-10-01 23:44:41,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 23:44:41,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 23:44:41,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1013, Invalid=3543, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:44:41,676 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 68 states. [2019-10-01 23:44:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:55,414 INFO L93 Difference]: Finished difference Result 288 states and 293 transitions. [2019-10-01 23:44:55,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-01 23:44:55,414 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 179 [2019-10-01 23:44:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:55,416 INFO L225 Difference]: With dead ends: 288 [2019-10-01 23:44:55,416 INFO L226 Difference]: Without dead ends: 195 [2019-10-01 23:44:55,417 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 141 SyntacticMatches, 15 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3172 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2923, Invalid=9959, Unknown=0, NotChecked=0, Total=12882 [2019-10-01 23:44:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-01 23:44:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-10-01 23:44:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-01 23:44:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-10-01 23:44:55,427 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 179 [2019-10-01 23:44:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:55,427 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-10-01 23:44:55,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 23:44:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-10-01 23:44:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-01 23:44:55,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:55,429 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:55,429 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:55,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:55,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1578495177, now seen corresponding path program 37 times [2019-10-01 23:44:55,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:55,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:55,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:55,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:55,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 147 proven. 123 refuted. 0 times theorem prover too weak. 1908 trivial. 0 not checked. [2019-10-01 23:44:55,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:55,811 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 23:44:55,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:56,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 23:44:56,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2019-10-01 23:44:57,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:57,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 45] total 65 [2019-10-01 23:44:57,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 23:44:57,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 23:44:57,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=3048, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 23:44:57,192 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 65 states. [2019-10-01 23:44:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:59,014 INFO L93 Difference]: Finished difference Result 336 states and 350 transitions. [2019-10-01 23:44:59,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 23:44:59,015 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 189 [2019-10-01 23:44:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:59,017 INFO L225 Difference]: With dead ends: 336 [2019-10-01 23:44:59,017 INFO L226 Difference]: Without dead ends: 197 [2019-10-01 23:44:59,019 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2535 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3585, Invalid=9987, Unknown=0, NotChecked=0, Total=13572 [2019-10-01 23:44:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-01 23:44:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-10-01 23:44:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-01 23:44:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-10-01 23:44:59,029 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 189 [2019-10-01 23:44:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:59,030 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-10-01 23:44:59,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 23:44:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-10-01 23:44:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-01 23:44:59,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:59,031 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:59,032 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:59,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1349048620, now seen corresponding path program 38 times [2019-10-01 23:44:59,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:59,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 18 proven. 1849 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-10-01 23:45:00,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:00,112 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:45:00,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:45:00,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:45:00,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:00,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 23:45:00,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:45:00,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:00,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 23:45:00,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 23:45:00,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 23:45:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:45:00,345 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 47 states. [2019-10-01 23:45:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:00,481 INFO L93 Difference]: Finished difference Result 302 states and 306 transitions. [2019-10-01 23:45:00,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 23:45:00,482 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 193 [2019-10-01 23:45:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:00,483 INFO L225 Difference]: With dead ends: 302 [2019-10-01 23:45:00,483 INFO L226 Difference]: Without dead ends: 199 [2019-10-01 23:45:00,484 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:45:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-01 23:45:00,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-10-01 23:45:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-01 23:45:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2019-10-01 23:45:00,493 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 200 transitions. Word has length 193 [2019-10-01 23:45:00,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:00,493 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 200 transitions. [2019-10-01 23:45:00,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 23:45:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 200 transitions. [2019-10-01 23:45:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-01 23:45:00,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:00,495 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:00,495 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:00,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:00,495 INFO L82 PathProgramCache]: Analyzing trace with hash 836371530, now seen corresponding path program 39 times [2019-10-01 23:45:00,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:00,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:00,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:00,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:00,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2370 backedges. 18 proven. 1936 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-10-01 23:45:01,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:01,368 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 23:45:01,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:45:01,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 23:45:01,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:01,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 23:45:01,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:03,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:45:03,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:45:03,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:45:03,417 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 23:45:03,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:45:03,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:45:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2370 backedges. 24 proven. 290 refuted. 0 times theorem prover too weak. 2056 trivial. 0 not checked. [2019-10-01 23:45:03,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:03,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 30] total 75 [2019-10-01 23:45:03,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-01 23:45:03,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-01 23:45:03,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1160, Invalid=4390, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 23:45:03,597 INFO L87 Difference]: Start difference. First operand 198 states and 200 transitions. Second operand 75 states. [2019-10-01 23:45:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:14,803 INFO L93 Difference]: Finished difference Result 314 states and 319 transitions. [2019-10-01 23:45:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-01 23:45:14,804 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 195 [2019-10-01 23:45:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:14,806 INFO L225 Difference]: With dead ends: 314 [2019-10-01 23:45:14,806 INFO L226 Difference]: Without dead ends: 211 [2019-10-01 23:45:14,807 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 151 SyntacticMatches, 17 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4515 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3418, Invalid=14672, Unknown=0, NotChecked=0, Total=18090 [2019-10-01 23:45:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-01 23:45:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2019-10-01 23:45:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-01 23:45:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2019-10-01 23:45:14,817 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 195 [2019-10-01 23:45:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:14,818 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2019-10-01 23:45:14,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-01 23:45:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2019-10-01 23:45:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-01 23:45:14,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:14,819 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:14,820 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash -640186337, now seen corresponding path program 40 times [2019-10-01 23:45:14,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:14,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:14,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:14,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:14,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 20 proven. 2025 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-01 23:45:15,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:15,800 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 23:45:15,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:45:16,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:45:16,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:16,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 23:45:16,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:45:16,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:16,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-01 23:45:16,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 23:45:16,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 23:45:16,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:45:16,093 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 49 states. [2019-10-01 23:45:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:16,265 INFO L93 Difference]: Finished difference Result 322 states and 326 transitions. [2019-10-01 23:45:16,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 23:45:16,265 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 205 [2019-10-01 23:45:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:16,267 INFO L225 Difference]: With dead ends: 322 [2019-10-01 23:45:16,267 INFO L226 Difference]: Without dead ends: 211 [2019-10-01 23:45:16,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:45:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-01 23:45:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2019-10-01 23:45:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-01 23:45:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-10-01 23:45:16,279 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-10-01 23:45:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:16,280 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-10-01 23:45:16,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 23:45:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-10-01 23:45:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-01 23:45:16,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:16,282 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:16,282 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:16,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash 255522365, now seen corresponding path program 41 times [2019-10-01 23:45:16,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:16,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2626 backedges. 20 proven. 2116 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-01 23:45:17,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:17,553 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:45:17,655 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:45:38,183 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-10-01 23:45:38,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:38,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 23:45:38,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2626 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2019-10-01 23:45:38,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:38,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 23:45:38,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 23:45:38,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 23:45:38,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 23:45:38,298 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 50 states. [2019-10-01 23:45:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:38,506 INFO L93 Difference]: Finished difference Result 324 states and 328 transitions. [2019-10-01 23:45:38,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 23:45:38,506 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 207 [2019-10-01 23:45:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:38,508 INFO L225 Difference]: With dead ends: 324 [2019-10-01 23:45:38,508 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 23:45:38,509 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 23:45:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 23:45:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-10-01 23:45:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-01 23:45:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2019-10-01 23:45:38,523 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 207 [2019-10-01 23:45:38,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:38,524 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2019-10-01 23:45:38,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 23:45:38,524 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2019-10-01 23:45:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-01 23:45:38,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:38,526 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:38,527 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:38,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:38,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2038125787, now seen corresponding path program 42 times [2019-10-01 23:45:38,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:38,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:38,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:38,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:38,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2719 backedges. 20 proven. 2209 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-01 23:45:39,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:39,702 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:45:39,807 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:45:40,683 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-01 23:45:40,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:40,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:45:40,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2719 backedges. 220 proven. 110 refuted. 0 times theorem prover too weak. 2389 trivial. 0 not checked. [2019-10-01 23:45:41,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:41,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 24] total 72 [2019-10-01 23:45:41,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-01 23:45:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-01 23:45:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1390, Invalid=3722, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 23:45:41,441 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 72 states. [2019-10-01 23:45:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:43,832 INFO L93 Difference]: Finished difference Result 370 states and 385 transitions. [2019-10-01 23:45:43,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-01 23:45:43,833 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 209 [2019-10-01 23:45:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:43,834 INFO L225 Difference]: With dead ends: 370 [2019-10-01 23:45:43,834 INFO L226 Difference]: Without dead ends: 217 [2019-10-01 23:45:43,835 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2752 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4318, Invalid=9962, Unknown=0, NotChecked=0, Total=14280 [2019-10-01 23:45:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-01 23:45:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2019-10-01 23:45:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-01 23:45:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2019-10-01 23:45:43,845 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 209 [2019-10-01 23:45:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:43,846 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2019-10-01 23:45:43,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-01 23:45:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2019-10-01 23:45:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-01 23:45:43,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:43,847 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:43,848 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:43,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:43,848 INFO L82 PathProgramCache]: Analyzing trace with hash 184837758, now seen corresponding path program 43 times [2019-10-01 23:45:43,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:43,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:43,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2836 backedges. 20 proven. 2304 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-10-01 23:45:44,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:44,911 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:45:45,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:45:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:45,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-01 23:45:45,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2836 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (49)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:45:45,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:45,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-10-01 23:45:45,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 23:45:45,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 23:45:45,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 23:45:45,159 INFO L87 Difference]: Start difference. First operand 216 states and 218 transitions. Second operand 52 states. [2019-10-01 23:45:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:45,366 INFO L93 Difference]: Finished difference Result 332 states and 336 transitions. [2019-10-01 23:45:45,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 23:45:45,367 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 213 [2019-10-01 23:45:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:45,368 INFO L225 Difference]: With dead ends: 332 [2019-10-01 23:45:45,368 INFO L226 Difference]: Without dead ends: 219 [2019-10-01 23:45:45,369 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 23:45:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-01 23:45:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2019-10-01 23:45:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-10-01 23:45:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 220 transitions. [2019-10-01 23:45:45,378 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 220 transitions. Word has length 213 [2019-10-01 23:45:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:45,379 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 220 transitions. [2019-10-01 23:45:45,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 23:45:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 220 transitions. [2019-10-01 23:45:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-01 23:45:45,380 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:45,381 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:45,381 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash -182528356, now seen corresponding path program 44 times [2019-10-01 23:45:45,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:45,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:45,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:45,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:45:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2933 backedges. 20 proven. 2401 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-10-01 23:45:46,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:46,428 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:45:46,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:45:46,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:45:46,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:46,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 23:45:46,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2933 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-10-01 23:45:46,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:46,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 23:45:46,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 23:45:46,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 23:45:46,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:45:46,693 INFO L87 Difference]: Start difference. First operand 218 states and 220 transitions. Second operand 53 states. [2019-10-01 23:45:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:46,876 INFO L93 Difference]: Finished difference Result 334 states and 338 transitions. [2019-10-01 23:45:46,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 23:45:46,876 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 215 [2019-10-01 23:45:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:46,877 INFO L225 Difference]: With dead ends: 334 [2019-10-01 23:45:46,878 INFO L226 Difference]: Without dead ends: 221 [2019-10-01 23:45:46,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:45:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-01 23:45:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-10-01 23:45:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-01 23:45:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-10-01 23:45:46,888 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 215 [2019-10-01 23:45:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:46,888 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-10-01 23:45:46,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 23:45:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-10-01 23:45:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-01 23:45:46,890 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:46,890 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:46,890 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:46,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1034045638, now seen corresponding path program 45 times [2019-10-01 23:45:46,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:46,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:46,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:46,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:46,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 20 proven. 2500 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-10-01 23:45:47,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:47,965 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:45:48,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:45:48,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:45:48,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:48,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 23:45:48,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:50,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:45:50,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:45:50,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:45:50,377 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 23:45:50,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:45:50,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:45:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 27 proven. 352 refuted. 0 times theorem prover too weak. 2653 trivial. 0 not checked. [2019-10-01 23:45:50,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:50,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 32] total 83 [2019-10-01 23:45:50,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-01 23:45:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-01 23:45:50,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1463, Invalid=5343, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 23:45:50,602 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 83 states. [2019-10-01 23:46:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:10,823 INFO L93 Difference]: Finished difference Result 346 states and 351 transitions. [2019-10-01 23:46:10,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-10-01 23:46:10,823 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 217 [2019-10-01 23:46:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:10,825 INFO L225 Difference]: With dead ends: 346 [2019-10-01 23:46:10,825 INFO L226 Difference]: Without dead ends: 233 [2019-10-01 23:46:10,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 169 SyntacticMatches, 19 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5582 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4322, Invalid=18028, Unknown=0, NotChecked=0, Total=22350 [2019-10-01 23:46:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-01 23:46:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2019-10-01 23:46:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-01 23:46:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 232 transitions. [2019-10-01 23:46:10,836 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 232 transitions. Word has length 217 [2019-10-01 23:46:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:10,836 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 232 transitions. [2019-10-01 23:46:10,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-01 23:46:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 232 transitions. [2019-10-01 23:46:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-01 23:46:10,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:10,874 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:10,874 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:10,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1090134159, now seen corresponding path program 46 times [2019-10-01 23:46:10,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:10,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:10,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:10,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:10,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3217 backedges. 22 proven. 2601 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-10-01 23:46:12,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:12,034 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:12,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:46:12,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:46:12,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:46:12,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 23:46:12,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3217 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2019-10-01 23:46:12,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:12,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-01 23:46:12,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 23:46:12,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 23:46:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 23:46:12,354 INFO L87 Difference]: Start difference. First operand 230 states and 232 transitions. Second operand 55 states. [2019-10-01 23:46:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:12,572 INFO L93 Difference]: Finished difference Result 354 states and 358 transitions. [2019-10-01 23:46:12,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 23:46:12,573 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2019-10-01 23:46:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:12,574 INFO L225 Difference]: With dead ends: 354 [2019-10-01 23:46:12,575 INFO L226 Difference]: Without dead ends: 233 [2019-10-01 23:46:12,575 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 23:46:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-01 23:46:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-10-01 23:46:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-01 23:46:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 234 transitions. [2019-10-01 23:46:12,588 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 234 transitions. Word has length 227 [2019-10-01 23:46:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:12,588 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 234 transitions. [2019-10-01 23:46:12,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 23:46:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 234 transitions. [2019-10-01 23:46:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-01 23:46:12,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:12,590 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:12,590 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:12,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:12,590 INFO L82 PathProgramCache]: Analyzing trace with hash -70843347, now seen corresponding path program 47 times [2019-10-01 23:46:12,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:12,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:12,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:12,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:12,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3320 backedges. 22 proven. 2704 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-10-01 23:46:13,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:13,772 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:13,898 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:46:41,782 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-10-01 23:46:41,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:46:41,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 23:46:41,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3320 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2019-10-01 23:46:41,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:41,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 23:46:41,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 23:46:41,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 23:46:41,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 23:46:41,864 INFO L87 Difference]: Start difference. First operand 232 states and 234 transitions. Second operand 56 states. [2019-10-01 23:46:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:42,056 INFO L93 Difference]: Finished difference Result 356 states and 360 transitions. [2019-10-01 23:46:42,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 23:46:42,056 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 229 [2019-10-01 23:46:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:42,058 INFO L225 Difference]: With dead ends: 356 [2019-10-01 23:46:42,058 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 23:46:42,059 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 23:46:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 23:46:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2019-10-01 23:46:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-10-01 23:46:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-10-01 23:46:42,069 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 229 [2019-10-01 23:46:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:42,070 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-10-01 23:46:42,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 23:46:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-10-01 23:46:42,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-01 23:46:42,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:42,071 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:42,072 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:42,072 INFO L82 PathProgramCache]: Analyzing trace with hash 921270347, now seen corresponding path program 48 times [2019-10-01 23:46:42,072 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:42,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:42,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:42,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:42,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 22 proven. 2809 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-10-01 23:46:43,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:43,426 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:43,552 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:46:45,849 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 23:46:45,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:46:45,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:46:45,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 264 proven. 132 refuted. 0 times theorem prover too weak. 3029 trivial. 0 not checked. [2019-10-01 23:46:46,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:46,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 26] total 80 [2019-10-01 23:46:46,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-01 23:46:46,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-01 23:46:46,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1732, Invalid=4588, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 23:46:46,733 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 80 states. [2019-10-01 23:46:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:49,481 INFO L93 Difference]: Finished difference Result 406 states and 422 transitions. [2019-10-01 23:46:49,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-01 23:46:49,481 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 231 [2019-10-01 23:46:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:49,482 INFO L225 Difference]: With dead ends: 406 [2019-10-01 23:46:49,483 INFO L226 Difference]: Without dead ends: 239 [2019-10-01 23:46:49,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3429 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5404, Invalid=12418, Unknown=0, NotChecked=0, Total=17822 [2019-10-01 23:46:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-01 23:46:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-10-01 23:46:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-01 23:46:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 240 transitions. [2019-10-01 23:46:49,496 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 240 transitions. Word has length 231 [2019-10-01 23:46:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:49,496 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 240 transitions. [2019-10-01 23:46:49,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-01 23:46:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 240 transitions. [2019-10-01 23:46:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-01 23:46:49,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:49,498 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:49,498 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1924964306, now seen corresponding path program 49 times [2019-10-01 23:46:49,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:49,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:49,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:49,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3556 backedges. 22 proven. 2916 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-10-01 23:46:51,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:51,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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:51,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:46:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:51,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 23:46:51,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3556 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-10-01 23:46:51,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:51,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-10-01 23:46:51,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 23:46:51,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 23:46:51,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 23:46:51,530 INFO L87 Difference]: Start difference. First operand 238 states and 240 transitions. Second operand 58 states. [2019-10-01 23:46:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:51,764 INFO L93 Difference]: Finished difference Result 364 states and 368 transitions. [2019-10-01 23:46:51,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 23:46:51,764 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 235 [2019-10-01 23:46:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:51,765 INFO L225 Difference]: With dead ends: 364 [2019-10-01 23:46:51,765 INFO L226 Difference]: Without dead ends: 241 [2019-10-01 23:46:51,766 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 23:46:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-01 23:46:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2019-10-01 23:46:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-01 23:46:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 242 transitions. [2019-10-01 23:46:51,777 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 242 transitions. Word has length 235 [2019-10-01 23:46:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:51,778 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 242 transitions. [2019-10-01 23:46:51,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 23:46:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 242 transitions. [2019-10-01 23:46:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-01 23:46:51,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:51,780 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:51,781 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:51,781 INFO L82 PathProgramCache]: Analyzing trace with hash -323369524, now seen corresponding path program 50 times [2019-10-01 23:46:51,782 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:51,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:51,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:51,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:46:51,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3665 backedges. 22 proven. 3025 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-10-01 23:46:53,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:53,225 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:53,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:46:53,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:46:53,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:46:53,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 23:46:53,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3665 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (56)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:46:53,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:53,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-01 23:46:53,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 23:46:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 23:46:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:46:53,521 INFO L87 Difference]: Start difference. First operand 240 states and 242 transitions. Second operand 59 states. [2019-10-01 23:46:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:53,694 INFO L93 Difference]: Finished difference Result 366 states and 370 transitions. [2019-10-01 23:46:53,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 23:46:53,695 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 237 [2019-10-01 23:46:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:53,696 INFO L225 Difference]: With dead ends: 366 [2019-10-01 23:46:53,696 INFO L226 Difference]: Without dead ends: 243 [2019-10-01 23:46:53,697 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:46:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-01 23:46:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-10-01 23:46:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-01 23:46:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 244 transitions. [2019-10-01 23:46:53,707 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 244 transitions. Word has length 237 [2019-10-01 23:46:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:53,707 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 244 transitions. [2019-10-01 23:46:53,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 23:46:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 244 transitions. [2019-10-01 23:46:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-01 23:46:53,709 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:53,709 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:53,709 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:53,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:53,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1210924010, now seen corresponding path program 51 times [2019-10-01 23:46:53,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:53,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:53,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:53,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:53,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3776 backedges. 22 proven. 3136 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-10-01 23:46:55,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:55,099 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:46:55,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 23:46:55,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:46:55,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:46:55,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:58,622 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:46:58,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:46:58,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2019-10-01 23:46:58,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:46:58,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:46:58,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:46:58,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-10-01 23:46:58,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:46:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3776 backedges. 231 proven. 189 refuted. 0 times theorem prover too weak. 3356 trivial. 0 not checked. [2019-10-01 23:46:58,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:58,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 32] total 89 [2019-10-01 23:46:58,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 23:46:58,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 23:46:58,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1929, Invalid=5903, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 23:46:58,899 INFO L87 Difference]: Start difference. First operand 242 states and 244 transitions. Second operand 89 states. [2019-10-01 23:47:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:17,829 INFO L93 Difference]: Finished difference Result 423 states and 440 transitions. [2019-10-01 23:47:17,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-10-01 23:47:17,829 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 239 [2019-10-01 23:47:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:17,831 INFO L225 Difference]: With dead ends: 423 [2019-10-01 23:47:17,831 INFO L226 Difference]: Without dead ends: 247 [2019-10-01 23:47:17,832 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 189 SyntacticMatches, 21 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7949 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=6425, Invalid=22987, Unknown=0, NotChecked=0, Total=29412 [2019-10-01 23:47:17,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-01 23:47:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2019-10-01 23:47:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-10-01 23:47:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 248 transitions. [2019-10-01 23:47:17,845 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 248 transitions. Word has length 239 [2019-10-01 23:47:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:17,846 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 248 transitions. [2019-10-01 23:47:17,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-01 23:47:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 248 transitions. [2019-10-01 23:47:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-01 23:47:17,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:17,848 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 14, 13, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:17,848 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash 145013261, now seen corresponding path program 52 times [2019-10-01 23:47:17,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:17,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:17,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:17,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3915 backedges. 22 proven. 3249 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2019-10-01 23:47:19,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:19,283 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:47:19,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:47:19,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:47:19,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:19,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 23:47:19,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3915 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-10-01 23:47:19,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:19,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 23:47:19,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 23:47:19,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 23:47:19,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 23:47:19,594 INFO L87 Difference]: Start difference. First operand 246 states and 248 transitions. Second operand 61 states. [2019-10-01 23:47:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:19,856 INFO L93 Difference]: Finished difference Result 374 states and 378 transitions. [2019-10-01 23:47:19,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 23:47:19,856 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 243 [2019-10-01 23:47:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:19,857 INFO L225 Difference]: With dead ends: 374 [2019-10-01 23:47:19,857 INFO L226 Difference]: Without dead ends: 249 [2019-10-01 23:47:19,858 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 23:47:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-01 23:47:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2019-10-01 23:47:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-01 23:47:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-10-01 23:47:19,869 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 243 [2019-10-01 23:47:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:19,869 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-10-01 23:47:19,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 23:47:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-10-01 23:47:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-01 23:47:19,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:19,871 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 14, 13, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:19,872 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:19,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:19,872 INFO L82 PathProgramCache]: Analyzing trace with hash 337813931, now seen corresponding path program 53 times [2019-10-01 23:47:19,872 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:19,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:19,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:19,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:19,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 22 proven. 3364 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2019-10-01 23:47:21,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:21,261 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:47:21,409 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:47:39,270 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2019-10-01 23:47:39,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:39,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 23:47:39,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-10-01 23:47:39,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:39,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-10-01 23:47:39,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 23:47:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 23:47:39,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 23:47:39,358 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 62 states. [2019-10-01 23:47:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:39,572 INFO L93 Difference]: Finished difference Result 376 states and 380 transitions. [2019-10-01 23:47:39,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 23:47:39,573 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 245 [2019-10-01 23:47:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:39,574 INFO L225 Difference]: With dead ends: 376 [2019-10-01 23:47:39,574 INFO L226 Difference]: Without dead ends: 251 [2019-10-01 23:47:39,575 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 23:47:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-01 23:47:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-10-01 23:47:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-01 23:47:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 252 transitions. [2019-10-01 23:47:39,586 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 252 transitions. Word has length 245 [2019-10-01 23:47:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:39,586 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 252 transitions. [2019-10-01 23:47:39,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 23:47:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 252 transitions. [2019-10-01 23:47:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-01 23:47:39,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:39,588 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 14, 13, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:39,588 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:39,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:39,589 INFO L82 PathProgramCache]: Analyzing trace with hash 935664073, now seen corresponding path program 54 times [2019-10-01 23:47:39,589 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:39,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:39,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:39,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:39,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4147 backedges. 22 proven. 3481 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2019-10-01 23:47:41,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:41,536 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:47:41,686 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:47:43,712 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-10-01 23:47:43,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:43,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 23:47:43,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:46,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:47:46,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:47:46,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:47:46,340 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 23:47:46,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:47:46,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:47:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4147 backedges. 30 proven. 444 refuted. 0 times theorem prover too weak. 3673 trivial. 0 not checked. [2019-10-01 23:47:46,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:46,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 34] total 94 [2019-10-01 23:47:46,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-10-01 23:47:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-10-01 23:47:46,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=6760, Unknown=0, NotChecked=0, Total=8742 [2019-10-01 23:47:46,585 INFO L87 Difference]: Start difference. First operand 250 states and 252 transitions. Second operand 94 states. [2019-10-01 23:48:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:03,001 INFO L93 Difference]: Finished difference Result 388 states and 393 transitions. [2019-10-01 23:48:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-10-01 23:48:03,001 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 247 [2019-10-01 23:48:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:03,003 INFO L225 Difference]: With dead ends: 388 [2019-10-01 23:48:03,003 INFO L226 Difference]: Without dead ends: 263 [2019-10-01 23:48:03,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 195 SyntacticMatches, 21 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7186 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=5874, Invalid=23196, Unknown=0, NotChecked=0, Total=29070 [2019-10-01 23:48:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-01 23:48:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2019-10-01 23:48:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-01 23:48:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 262 transitions. [2019-10-01 23:48:03,017 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 262 transitions. Word has length 247 [2019-10-01 23:48:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:03,017 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 262 transitions. [2019-10-01 23:48:03,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-10-01 23:48:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 262 transitions. [2019-10-01 23:48:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-01 23:48:03,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:03,019 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:03,019 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:03,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1299858530, now seen corresponding path program 55 times [2019-10-01 23:48:03,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:03,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:03,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:03,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:03,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4358 backedges. 24 proven. 3600 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2019-10-01 23:48:04,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:04,760 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:48:04,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:48:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:05,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-01 23:48:05,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4358 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2019-10-01 23:48:05,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:05,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-10-01 23:48:05,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-01 23:48:05,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-01 23:48:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 23:48:05,100 INFO L87 Difference]: Start difference. First operand 260 states and 262 transitions. Second operand 64 states. [2019-10-01 23:48:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:05,348 INFO L93 Difference]: Finished difference Result 396 states and 400 transitions. [2019-10-01 23:48:05,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-01 23:48:05,349 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 257 [2019-10-01 23:48:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:05,350 INFO L225 Difference]: With dead ends: 396 [2019-10-01 23:48:05,350 INFO L226 Difference]: Without dead ends: 263 [2019-10-01 23:48:05,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 23:48:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-01 23:48:05,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-10-01 23:48:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-01 23:48:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-10-01 23:48:05,363 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 257 [2019-10-01 23:48:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:05,363 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-10-01 23:48:05,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-01 23:48:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-10-01 23:48:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-01 23:48:05,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:05,365 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:05,365 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:05,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash -779159876, now seen corresponding path program 56 times [2019-10-01 23:48:05,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:05,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:05,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:48:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 24 proven. 3721 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2019-10-01 23:48:06,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:06,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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:48:07,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:48:07,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:48:07,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:48:07,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-01 23:48:07,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2019-10-01 23:48:07,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:07,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-10-01 23:48:07,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 23:48:07,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 23:48:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 23:48:07,267 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 65 states. [2019-10-01 23:48:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:07,621 INFO L93 Difference]: Finished difference Result 398 states and 402 transitions. [2019-10-01 23:48:07,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 23:48:07,622 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 259 [2019-10-01 23:48:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:07,624 INFO L225 Difference]: With dead ends: 398 [2019-10-01 23:48:07,624 INFO L226 Difference]: Without dead ends: 265 [2019-10-01 23:48:07,625 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 23:48:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-01 23:48:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2019-10-01 23:48:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-01 23:48:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 266 transitions. [2019-10-01 23:48:07,642 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 266 transitions. Word has length 259 [2019-10-01 23:48:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:07,643 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 266 transitions. [2019-10-01 23:48:07,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 23:48:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 266 transitions. [2019-10-01 23:48:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-01 23:48:07,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:07,645 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:07,645 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:07,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1396040282, now seen corresponding path program 57 times [2019-10-01 23:48:07,646 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:07,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:07,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4602 backedges. 24 proven. 3844 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2019-10-01 23:48:09,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:09,331 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:48:09,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:48:09,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 23:48:09,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:48:09,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-01 23:48:09,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:12,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:48:12,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:48:12,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:48:12,696 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 23:48:12,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:48:12,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:48:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4602 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 4108 trivial. 0 not checked. [2019-10-01 23:48:12,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:12,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 34] total 97 [2019-10-01 23:48:12,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-10-01 23:48:12,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-10-01 23:48:12,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2171, Invalid=7141, Unknown=0, NotChecked=0, Total=9312 [2019-10-01 23:48:12,957 INFO L87 Difference]: Start difference. First operand 264 states and 266 transitions. Second operand 97 states. [2019-10-01 23:48:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:26,584 INFO L93 Difference]: Finished difference Result 410 states and 415 transitions. [2019-10-01 23:48:26,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-10-01 23:48:26,584 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 261 [2019-10-01 23:48:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:26,586 INFO L225 Difference]: With dead ends: 410 [2019-10-01 23:48:26,586 INFO L226 Difference]: Without dead ends: 277 [2019-10-01 23:48:26,588 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 207 SyntacticMatches, 23 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6724 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=6349, Invalid=20383, Unknown=0, NotChecked=0, Total=26732 [2019-10-01 23:48:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-01 23:48:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 274. [2019-10-01 23:48:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-10-01 23:48:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 276 transitions. [2019-10-01 23:48:26,600 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 276 transitions. Word has length 261 [2019-10-01 23:48:26,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:26,600 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 276 transitions. [2019-10-01 23:48:26,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-10-01 23:48:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 276 transitions. [2019-10-01 23:48:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-01 23:48:26,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:26,603 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:26,603 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:26,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:26,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1491372369, now seen corresponding path program 58 times [2019-10-01 23:48:26,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:26,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:26,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:26,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:26,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4827 backedges. 26 proven. 3969 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-10-01 23:48:28,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:28,263 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:48:28,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:48:28,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:48:28,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:48:28,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 23:48:28,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4827 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2019-10-01 23:48:28,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:28,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 23:48:28,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 23:48:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 23:48:28,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:48:28,609 INFO L87 Difference]: Start difference. First operand 274 states and 276 transitions. Second operand 67 states. [2019-10-01 23:48:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:28,906 INFO L93 Difference]: Finished difference Result 418 states and 422 transitions. [2019-10-01 23:48:28,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 23:48:28,907 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 271 [2019-10-01 23:48:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:28,908 INFO L225 Difference]: With dead ends: 418 [2019-10-01 23:48:28,908 INFO L226 Difference]: Without dead ends: 277 [2019-10-01 23:48:28,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:48:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-01 23:48:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2019-10-01 23:48:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-01 23:48:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-10-01 23:48:28,921 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 271 [2019-10-01 23:48:28,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:28,921 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-10-01 23:48:28,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 23:48:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-10-01 23:48:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-01 23:48:28,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:28,923 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:28,924 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1536681293, now seen corresponding path program 59 times [2019-10-01 23:48:28,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:28,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:28,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:28,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:28,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4954 backedges. 26 proven. 4096 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-10-01 23:48:30,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:30,947 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:48:31,115 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:49:24,326 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2019-10-01 23:49:24,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:49:24,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 23:49:24,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:49:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4954 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2019-10-01 23:49:24,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:49:24,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 23:49:24,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 23:49:24,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 23:49:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:49:24,442 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 68 states. [2019-10-01 23:49:24,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:49:24,729 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-10-01 23:49:24,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 23:49:24,729 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 273 [2019-10-01 23:49:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:49:24,730 INFO L225 Difference]: With dead ends: 420 [2019-10-01 23:49:24,731 INFO L226 Difference]: Without dead ends: 279 [2019-10-01 23:49:24,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:49:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-01 23:49:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 278. [2019-10-01 23:49:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-01 23:49:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 280 transitions. [2019-10-01 23:49:24,744 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 280 transitions. Word has length 273 [2019-10-01 23:49:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:49:24,744 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 280 transitions. [2019-10-01 23:49:24,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 23:49:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 280 transitions. [2019-10-01 23:49:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-10-01 23:49:24,746 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:49:24,746 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:49:24,746 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:49:24,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:49:24,747 INFO L82 PathProgramCache]: Analyzing trace with hash -491576213, now seen corresponding path program 60 times [2019-10-01 23:49:24,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:49:24,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:49:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:24,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:49:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:49:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5083 backedges. 26 proven. 4225 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-10-01 23:49:26,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:49:26,449 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:49:26,622 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:49:29,111 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-10-01 23:49:29,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:49:29,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:49:29,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:49:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5083 backedges. 364 proven. 182 refuted. 0 times theorem prover too weak. 4537 trivial. 0 not checked. [2019-10-01 23:49:30,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:49:30,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 30] total 96 [2019-10-01 23:49:30,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-10-01 23:49:30,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-10-01 23:49:30,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2530, Invalid=6590, Unknown=0, NotChecked=0, Total=9120 [2019-10-01 23:49:30,221 INFO L87 Difference]: Start difference. First operand 278 states and 280 transitions. Second operand 96 states. [2019-10-01 23:49:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:49:33,379 INFO L93 Difference]: Finished difference Result 478 states and 496 transitions. [2019-10-01 23:49:33,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-10-01 23:49:33,382 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 275 [2019-10-01 23:49:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:49:33,383 INFO L225 Difference]: With dead ends: 478 [2019-10-01 23:49:33,384 INFO L226 Difference]: Without dead ends: 283 [2019-10-01 23:49:33,386 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5005 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7942, Invalid=18140, Unknown=0, NotChecked=0, Total=26082 [2019-10-01 23:49:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-01 23:49:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 282. [2019-10-01 23:49:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-10-01 23:49:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 284 transitions. [2019-10-01 23:49:33,399 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 284 transitions. Word has length 275 [2019-10-01 23:49:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:49:33,399 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 284 transitions. [2019-10-01 23:49:33,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-10-01 23:49:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 284 transitions. [2019-10-01 23:49:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-01 23:49:33,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:49:33,402 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:49:33,402 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:49:33,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:49:33,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1787508530, now seen corresponding path program 61 times [2019-10-01 23:49:33,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:49:33,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:49:33,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:33,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:49:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:49:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5242 backedges. 26 proven. 4356 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-01 23:49:35,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:49:35,180 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:49:35,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:49:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:49:35,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 68 conjunts are in the unsatisfiable core [2019-10-01 23:49:35,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:49:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5242 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2019-10-01 23:49:35,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:49:35,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 70 [2019-10-01 23:49:35,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 23:49:35,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 23:49:35,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 23:49:35,535 INFO L87 Difference]: Start difference. First operand 282 states and 284 transitions. Second operand 70 states. [2019-10-01 23:49:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:49:35,826 INFO L93 Difference]: Finished difference Result 428 states and 432 transitions. [2019-10-01 23:49:35,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-01 23:49:35,826 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 279 [2019-10-01 23:49:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:49:35,828 INFO L225 Difference]: With dead ends: 428 [2019-10-01 23:49:35,828 INFO L226 Difference]: Without dead ends: 285 [2019-10-01 23:49:35,828 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 23:49:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-01 23:49:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 284. [2019-10-01 23:49:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-01 23:49:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 286 transitions. [2019-10-01 23:49:35,837 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 286 transitions. Word has length 279 [2019-10-01 23:49:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:49:35,837 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 286 transitions. [2019-10-01 23:49:35,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 23:49:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 286 transitions. [2019-10-01 23:49:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-01 23:49:35,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:49:35,839 INFO L411 BasicCegarLoop]: trace histogram [67, 67, 15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:49:35,840 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:49:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:49:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash -136332948, now seen corresponding path program 62 times [2019-10-01 23:49:35,840 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:49:35,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:49:35,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:35,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:49:35,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:49:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5375 backedges. 26 proven. 4489 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-01 23:49:37,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:49:37,625 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:49:37,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:49:37,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:49:37,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:49:37,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-01 23:49:37,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:49:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5375 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2019-10-01 23:49:38,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:49:38,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 71 [2019-10-01 23:49:38,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-01 23:49:38,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-01 23:49:38,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-10-01 23:49:38,001 INFO L87 Difference]: Start difference. First operand 284 states and 286 transitions. Second operand 71 states. [2019-10-01 23:49:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:49:38,285 INFO L93 Difference]: Finished difference Result 430 states and 434 transitions. [2019-10-01 23:49:38,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 23:49:38,285 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 281 [2019-10-01 23:49:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:49:38,286 INFO L225 Difference]: With dead ends: 430 [2019-10-01 23:49:38,286 INFO L226 Difference]: Without dead ends: 287 [2019-10-01 23:49:38,287 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-10-01 23:49:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-01 23:49:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2019-10-01 23:49:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-01 23:49:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 288 transitions. [2019-10-01 23:49:38,294 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 288 transitions. Word has length 281 [2019-10-01 23:49:38,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:49:38,295 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 288 transitions. [2019-10-01 23:49:38,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-01 23:49:38,295 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 288 transitions. [2019-10-01 23:49:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-01 23:49:38,296 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:49:38,297 INFO L411 BasicCegarLoop]: trace histogram [68, 68, 15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:49:38,297 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:49:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:49:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1800469130, now seen corresponding path program 63 times [2019-10-01 23:49:38,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:49:38,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:49:38,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:38,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:49:38,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:49:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5510 backedges. 26 proven. 4624 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-01 23:49:40,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:49:40,129 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:49:40,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:49:40,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:49:40,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:49:40,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-01 23:49:40,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:49:44,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:49:44,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:49:44,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:49:44,034 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 23:49:44,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:49:44,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:49:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5510 backedges. 36 proven. 574 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-10-01 23:49:44,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:49:44,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 38] total 107 [2019-10-01 23:49:44,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-10-01 23:49:44,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-10-01 23:49:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2588, Invalid=8754, Unknown=0, NotChecked=0, Total=11342 [2019-10-01 23:49:44,342 INFO L87 Difference]: Start difference. First operand 286 states and 288 transitions. Second operand 107 states. [2019-10-01 23:49:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:49:59,640 INFO L93 Difference]: Finished difference Result 442 states and 447 transitions. [2019-10-01 23:49:59,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-10-01 23:49:59,640 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 283 [2019-10-01 23:49:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:49:59,642 INFO L225 Difference]: With dead ends: 442 [2019-10-01 23:49:59,642 INFO L226 Difference]: Without dead ends: 299 [2019-10-01 23:49:59,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 223 SyntacticMatches, 25 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9449 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=7682, Invalid=30148, Unknown=0, NotChecked=0, Total=37830 [2019-10-01 23:49:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-10-01 23:49:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-10-01 23:49:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-01 23:49:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 298 transitions. [2019-10-01 23:49:59,655 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 298 transitions. Word has length 283 [2019-10-01 23:49:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:49:59,655 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 298 transitions. [2019-10-01 23:49:59,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-10-01 23:49:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 298 transitions. [2019-10-01 23:49:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-01 23:49:59,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:49:59,658 INFO L411 BasicCegarLoop]: trace histogram [69, 69, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:49:59,658 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:49:59,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:49:59,658 INFO L82 PathProgramCache]: Analyzing trace with hash -898575265, now seen corresponding path program 64 times [2019-10-01 23:49:59,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:49:59,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:49:59,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:59,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:49:59,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5755 backedges. 28 proven. 4761 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-10-01 23:50:01,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:50:01,642 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:50:01,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:50:01,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:50:01,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:50:01,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 71 conjunts are in the unsatisfiable core [2019-10-01 23:50:01,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:50:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5755 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2019-10-01 23:50:02,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:50:02,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 73 [2019-10-01 23:50:02,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 23:50:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 23:50:02,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 23:50:02,057 INFO L87 Difference]: Start difference. First operand 296 states and 298 transitions. Second operand 73 states. [2019-10-01 23:50:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:50:02,328 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-10-01 23:50:02,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-01 23:50:02,329 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 293 [2019-10-01 23:50:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:50:02,330 INFO L225 Difference]: With dead ends: 450 [2019-10-01 23:50:02,330 INFO L226 Difference]: Without dead ends: 299 [2019-10-01 23:50:02,331 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 23:50:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-10-01 23:50:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2019-10-01 23:50:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-01 23:50:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 300 transitions. [2019-10-01 23:50:02,344 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 300 transitions. Word has length 293 [2019-10-01 23:50:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:50:02,344 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 300 transitions. [2019-10-01 23:50:02,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 23:50:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 300 transitions. [2019-10-01 23:50:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-01 23:50:02,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:50:02,346 INFO L411 BasicCegarLoop]: trace histogram [70, 70, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:50:02,346 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:50:02,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:50:02,347 INFO L82 PathProgramCache]: Analyzing trace with hash -731686787, now seen corresponding path program 65 times [2019-10-01 23:50:02,347 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:50:02,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:50:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:02,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:50:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5894 backedges. 28 proven. 4900 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-10-01 23:50:04,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:50:04,704 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:50:04,903 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:51:29,359 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 71 check-sat command(s) [2019-10-01 23:51:29,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:51:29,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 72 conjunts are in the unsatisfiable core [2019-10-01 23:51:29,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5894 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2019-10-01 23:51:29,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:29,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 74 [2019-10-01 23:51:29,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-01 23:51:29,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-01 23:51:29,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-10-01 23:51:29,486 INFO L87 Difference]: Start difference. First operand 298 states and 300 transitions. Second operand 74 states. [2019-10-01 23:51:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:51:29,753 INFO L93 Difference]: Finished difference Result 452 states and 456 transitions. [2019-10-01 23:51:29,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 23:51:29,754 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 295 [2019-10-01 23:51:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:51:29,756 INFO L225 Difference]: With dead ends: 452 [2019-10-01 23:51:29,756 INFO L226 Difference]: Without dead ends: 301 [2019-10-01 23:51:29,757 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-10-01 23:51:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-01 23:51:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2019-10-01 23:51:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-01 23:51:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 302 transitions. [2019-10-01 23:51:29,769 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 302 transitions. Word has length 295 [2019-10-01 23:51:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:51:29,770 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 302 transitions. [2019-10-01 23:51:29,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-01 23:51:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 302 transitions. [2019-10-01 23:51:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-01 23:51:29,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:51:29,773 INFO L411 BasicCegarLoop]: trace histogram [71, 71, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:51:29,773 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:51:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:51:29,774 INFO L82 PathProgramCache]: Analyzing trace with hash 734350619, now seen corresponding path program 66 times [2019-10-01 23:51:29,774 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:51:29,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:51:29,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:29,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:51:29,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 28 proven. 5041 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-10-01 23:51:31,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:31,812 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:51:32,017 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:51:36,668 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 23:51:36,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:51:36,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:51:36,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:37,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 5405 trivial. 0 not checked. [2019-10-01 23:51:37,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:37,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 32] total 104 [2019-10-01 23:51:37,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-10-01 23:51:37,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-10-01 23:51:37,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2986, Invalid=7726, Unknown=0, NotChecked=0, Total=10712 [2019-10-01 23:51:37,957 INFO L87 Difference]: Start difference. First operand 300 states and 302 transitions. Second operand 104 states. [2019-10-01 23:51:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:51:41,402 INFO L93 Difference]: Finished difference Result 514 states and 533 transitions. [2019-10-01 23:51:41,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-10-01 23:51:41,403 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 297 [2019-10-01 23:51:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:51:41,404 INFO L225 Difference]: With dead ends: 514 [2019-10-01 23:51:41,404 INFO L226 Difference]: Without dead ends: 305 [2019-10-01 23:51:41,406 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5904 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9394, Invalid=21406, Unknown=0, NotChecked=0, Total=30800 [2019-10-01 23:51:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-01 23:51:41,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2019-10-01 23:51:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-01 23:51:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 306 transitions. [2019-10-01 23:51:41,416 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 306 transitions. Word has length 297 [2019-10-01 23:51:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:51:41,416 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 306 transitions. [2019-10-01 23:51:41,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-10-01 23:51:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 306 transitions. [2019-10-01 23:51:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-01 23:51:41,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:51:41,418 INFO L411 BasicCegarLoop]: trace histogram [72, 72, 16, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:51:41,419 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:51:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:51:41,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1985620034, now seen corresponding path program 67 times [2019-10-01 23:51:41,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:51:41,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:51:41,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:41,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:51:41,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6208 backedges. 28 proven. 5184 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2019-10-01 23:51:43,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:43,500 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:51:43,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:51:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:43,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-01 23:51:43,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6208 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-10-01 23:51:43,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:43,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 76 [2019-10-01 23:51:43,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-01 23:51:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-01 23:51:43,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 23:51:43,899 INFO L87 Difference]: Start difference. First operand 304 states and 306 transitions. Second operand 76 states. [2019-10-01 23:51:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:51:44,224 INFO L93 Difference]: Finished difference Result 460 states and 464 transitions. [2019-10-01 23:51:44,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-01 23:51:44,224 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 301 [2019-10-01 23:51:44,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:51:44,225 INFO L225 Difference]: With dead ends: 460 [2019-10-01 23:51:44,226 INFO L226 Difference]: Without dead ends: 307 [2019-10-01 23:51:44,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 23:51:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-01 23:51:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 306. [2019-10-01 23:51:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-10-01 23:51:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 308 transitions. [2019-10-01 23:51:44,235 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 308 transitions. Word has length 301 [2019-10-01 23:51:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:51:44,235 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 308 transitions. [2019-10-01 23:51:44,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-01 23:51:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 308 transitions. [2019-10-01 23:51:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-01 23:51:44,237 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:51:44,237 INFO L411 BasicCegarLoop]: trace histogram [73, 73, 16, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:51:44,238 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:51:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:51:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash 718888412, now seen corresponding path program 68 times [2019-10-01 23:51:44,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:51:44,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:51:44,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:44,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:51:44,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6353 backedges. 28 proven. 5329 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2019-10-01 23:51:46,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:46,355 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:51:46,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:51:46,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:51:46,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:51:46,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 75 conjunts are in the unsatisfiable core [2019-10-01 23:51:46,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6353 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (74)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:51:46,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:46,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 77 [2019-10-01 23:51:46,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-01 23:51:46,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-01 23:51:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 23:51:46,809 INFO L87 Difference]: Start difference. First operand 306 states and 308 transitions. Second operand 77 states. [2019-10-01 23:51:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:51:47,111 INFO L93 Difference]: Finished difference Result 462 states and 466 transitions. [2019-10-01 23:51:47,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-01 23:51:47,111 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 303 [2019-10-01 23:51:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:51:47,112 INFO L225 Difference]: With dead ends: 462 [2019-10-01 23:51:47,113 INFO L226 Difference]: Without dead ends: 309 [2019-10-01 23:51:47,113 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 23:51:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-01 23:51:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2019-10-01 23:51:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-10-01 23:51:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 310 transitions. [2019-10-01 23:51:47,122 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 310 transitions. Word has length 303 [2019-10-01 23:51:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:51:47,122 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 310 transitions. [2019-10-01 23:51:47,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-01 23:51:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 310 transitions. [2019-10-01 23:51:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-01 23:51:47,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:51:47,124 INFO L411 BasicCegarLoop]: trace histogram [74, 74, 16, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:51:47,125 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:51:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:51:47,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1296290938, now seen corresponding path program 69 times [2019-10-01 23:51:47,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:51:47,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:51:47,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:47,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:51:47,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6500 backedges. 28 proven. 5476 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2019-10-01 23:51:49,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:49,291 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:51:49,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:51:49,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 23:51:49,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:51:49,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 79 conjunts are in the unsatisfiable core [2019-10-01 23:51:49,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:50,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-01 23:51:50,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:51:50,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:51:50,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:51:50,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-01 23:51:54,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:51:54,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:51:54,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:51:54,179 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 23:51:54,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:51:54,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:51:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6500 backedges. 39 proven. 660 refuted. 0 times theorem prover too weak. 5801 trivial. 0 not checked. [2019-10-01 23:51:54,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:54,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 40] total 115 [2019-10-01 23:51:54,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-10-01 23:51:54,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-10-01 23:51:54,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3035, Invalid=10075, Unknown=0, NotChecked=0, Total=13110 [2019-10-01 23:51:54,504 INFO L87 Difference]: Start difference. First operand 308 states and 310 transitions. Second operand 115 states. [2019-10-01 23:52:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:52:11,671 INFO L93 Difference]: Finished difference Result 474 states and 479 transitions. [2019-10-01 23:52:11,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-10-01 23:52:11,671 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 305 [2019-10-01 23:52:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:52:11,673 INFO L225 Difference]: With dead ends: 474 [2019-10-01 23:52:11,673 INFO L226 Difference]: Without dead ends: 321 [2019-10-01 23:52:11,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 241 SyntacticMatches, 27 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10960 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=9018, Invalid=34872, Unknown=0, NotChecked=0, Total=43890 [2019-10-01 23:52:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-01 23:52:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2019-10-01 23:52:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-01 23:52:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 320 transitions. [2019-10-01 23:52:11,689 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 320 transitions. Word has length 305 [2019-10-01 23:52:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:52:11,689 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 320 transitions. [2019-10-01 23:52:11,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-10-01 23:52:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 320 transitions. [2019-10-01 23:52:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-01 23:52:11,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:52:11,692 INFO L411 BasicCegarLoop]: trace histogram [75, 75, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:52:11,692 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:52:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:52:11,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1941377999, now seen corresponding path program 70 times [2019-10-01 23:52:11,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:52:11,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:52:11,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:52:11,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:52:11,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:52:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:52:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 423 proven. 297 refuted. 0 times theorem prover too weak. 6045 trivial. 0 not checked. [2019-10-01 23:52:12,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:52:12,228 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:52:12,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:52:12,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:52:12,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:52:12,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 77 conjunts are in the unsatisfiable core [2019-10-01 23:52:12,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:52:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2019-10-01 23:52:15,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:52:15,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 78] total 110 [2019-10-01 23:52:15,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-10-01 23:52:15,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-10-01 23:52:15,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3293, Invalid=8697, Unknown=0, NotChecked=0, Total=11990 [2019-10-01 23:52:15,743 INFO L87 Difference]: Start difference. First operand 318 states and 320 transitions. Second operand 110 states. [2019-10-01 23:52:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:52:20,668 INFO L93 Difference]: Finished difference Result 546 states and 566 transitions. [2019-10-01 23:52:20,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-10-01 23:52:20,668 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 315 [2019-10-01 23:52:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:52:20,670 INFO L225 Difference]: With dead ends: 546 [2019-10-01 23:52:20,670 INFO L226 Difference]: Without dead ends: 323 [2019-10-01 23:52:20,673 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7680 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10707, Invalid=29493, Unknown=0, NotChecked=0, Total=40200 [2019-10-01 23:52:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-01 23:52:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2019-10-01 23:52:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-01 23:52:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 324 transitions. [2019-10-01 23:52:20,683 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 324 transitions. Word has length 315 [2019-10-01 23:52:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:52:20,683 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 324 transitions. [2019-10-01 23:52:20,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-10-01 23:52:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 324 transitions. [2019-10-01 23:52:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-10-01 23:52:20,684 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:52:20,684 INFO L411 BasicCegarLoop]: trace histogram [76, 76, 17, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:52:20,684 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:52:20,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:52:20,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1625518770, now seen corresponding path program 71 times [2019-10-01 23:52:20,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:52:20,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:52:20,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:52:20,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:52:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:52:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:52:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6948 backedges. 30 proven. 5776 refuted. 0 times theorem prover too weak. 1142 trivial. 0 not checked. [2019-10-01 23:52:22,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:52:22,960 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:52:23,196 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:54:05,644 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 77 check-sat command(s) [2019-10-01 23:54:05,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:54:05,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 78 conjunts are in the unsatisfiable core [2019-10-01 23:54:05,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6948 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2019-10-01 23:54:05,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:05,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 80 [2019-10-01 23:54:05,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-01 23:54:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-01 23:54:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 23:54:05,803 INFO L87 Difference]: Start difference. First operand 322 states and 324 transitions. Second operand 80 states. [2019-10-01 23:54:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:06,160 INFO L93 Difference]: Finished difference Result 488 states and 492 transitions. [2019-10-01 23:54:06,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-01 23:54:06,161 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 319 [2019-10-01 23:54:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:06,162 INFO L225 Difference]: With dead ends: 488 [2019-10-01 23:54:06,162 INFO L226 Difference]: Without dead ends: 325 [2019-10-01 23:54:06,163 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 23:54:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-01 23:54:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 324. [2019-10-01 23:54:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-10-01 23:54:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 326 transitions. [2019-10-01 23:54:06,176 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 326 transitions. Word has length 319 [2019-10-01 23:54:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:06,176 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 326 transitions. [2019-10-01 23:54:06,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-01 23:54:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 326 transitions. [2019-10-01 23:54:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-01 23:54:06,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:06,178 INFO L411 BasicCegarLoop]: trace histogram [77, 77, 17, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:06,178 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2072449712, now seen corresponding path program 72 times [2019-10-01 23:54:06,178 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:06,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:06,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:06,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:54:06,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7101 backedges. 30 proven. 5929 refuted. 0 times theorem prover too weak. 1142 trivial. 0 not checked. [2019-10-01 23:54:08,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:08,569 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:54:08,804 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:54:27,886 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 23:54:27,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:54:27,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 76 conjunts are in the unsatisfiable core [2019-10-01 23:54:27,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:27,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-01 23:54:27,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:54:27,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:54:27,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:54:27,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-01 23:54:31,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:54:31,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:54:31,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:54:31,946 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 23:54:31,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:54:32,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:54:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7101 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 6349 trivial. 0 not checked. [2019-10-01 23:54:32,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:32,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 40] total 118 [2019-10-01 23:54:32,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-10-01 23:54:32,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-10-01 23:54:32,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3269, Invalid=10537, Unknown=0, NotChecked=0, Total=13806 [2019-10-01 23:54:32,312 INFO L87 Difference]: Start difference. First operand 324 states and 326 transitions. Second operand 118 states. [2019-10-01 23:54:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:48,913 INFO L93 Difference]: Finished difference Result 500 states and 505 transitions. [2019-10-01 23:54:48,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-10-01 23:54:48,914 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 321 [2019-10-01 23:54:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:48,916 INFO L225 Difference]: With dead ends: 500 [2019-10-01 23:54:48,916 INFO L226 Difference]: Without dead ends: 337 [2019-10-01 23:54:48,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 255 SyntacticMatches, 29 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10126 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=9607, Invalid=30193, Unknown=0, NotChecked=0, Total=39800 [2019-10-01 23:54:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-01 23:54:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 334. [2019-10-01 23:54:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-01 23:54:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 336 transitions. [2019-10-01 23:54:48,928 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 336 transitions. Word has length 321 [2019-10-01 23:54:48,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:48,928 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 336 transitions. [2019-10-01 23:54:48,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-10-01 23:54:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 336 transitions. [2019-10-01 23:54:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-01 23:54:48,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:48,929 INFO L411 BasicCegarLoop]: trace histogram [78, 78, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:48,930 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1539242661, now seen corresponding path program 73 times [2019-10-01 23:54:48,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:48,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:48,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:48,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:54:48,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7380 backedges. 483 proven. 333 refuted. 0 times theorem prover too weak. 6564 trivial. 0 not checked. [2019-10-01 23:54:49,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:49,479 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:54:49,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:54:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:49,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 80 conjunts are in the unsatisfiable core [2019-10-01 23:54:49,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7380 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-10-01 23:54:53,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:53,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 81] total 115 [2019-10-01 23:54:53,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-10-01 23:54:53,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-10-01 23:54:53,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3565, Invalid=9545, Unknown=0, NotChecked=0, Total=13110 [2019-10-01 23:54:53,265 INFO L87 Difference]: Start difference. First operand 334 states and 336 transitions. Second operand 115 states. [2019-10-01 23:54:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:58,130 INFO L93 Difference]: Finished difference Result 576 states and 597 transitions. [2019-10-01 23:54:58,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-10-01 23:54:58,131 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 331 [2019-10-01 23:54:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:58,132 INFO L225 Difference]: With dead ends: 576 [2019-10-01 23:54:58,132 INFO L226 Difference]: Without dead ends: 339 [2019-10-01 23:54:58,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8451 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11611, Invalid=32279, Unknown=0, NotChecked=0, Total=43890 [2019-10-01 23:54:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-10-01 23:54:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 338. [2019-10-01 23:54:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-10-01 23:54:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 340 transitions. [2019-10-01 23:54:58,147 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 340 transitions. Word has length 331 [2019-10-01 23:54:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:58,147 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 340 transitions. [2019-10-01 23:54:58,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-10-01 23:54:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 340 transitions. [2019-10-01 23:54:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-01 23:54:58,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:58,149 INFO L411 BasicCegarLoop]: trace histogram [79, 79, 18, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:58,149 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:58,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:58,149 INFO L82 PathProgramCache]: Analyzing trace with hash -110764856, now seen corresponding path program 74 times [2019-10-01 23:54:58,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:58,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:58,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:58,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:54:58,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7571 backedges. 32 proven. 6241 refuted. 0 times theorem prover too weak. 1298 trivial. 0 not checked. [2019-10-01 23:55:00,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:00,616 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:00,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:55:01,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:01,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:01,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 81 conjunts are in the unsatisfiable core [2019-10-01 23:55:01,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7571 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2019-10-01 23:55:01,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:01,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 83 [2019-10-01 23:55:01,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-01 23:55:01,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-01 23:55:01,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 23:55:01,084 INFO L87 Difference]: Start difference. First operand 338 states and 340 transitions. Second operand 83 states. [2019-10-01 23:55:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:01,439 INFO L93 Difference]: Finished difference Result 514 states and 518 transitions. [2019-10-01 23:55:01,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 23:55:01,439 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 335 [2019-10-01 23:55:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:01,441 INFO L225 Difference]: With dead ends: 514 [2019-10-01 23:55:01,441 INFO L226 Difference]: Without dead ends: 341 [2019-10-01 23:55:01,442 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 23:55:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-10-01 23:55:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 340. [2019-10-01 23:55:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-01 23:55:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 342 transitions. [2019-10-01 23:55:01,452 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 342 transitions. Word has length 335 [2019-10-01 23:55:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:01,452 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 342 transitions. [2019-10-01 23:55:01,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-01 23:55:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 342 transitions. [2019-10-01 23:55:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-10-01 23:55:01,455 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:01,456 INFO L411 BasicCegarLoop]: trace histogram [80, 80, 18, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:01,456 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:01,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:01,456 INFO L82 PathProgramCache]: Analyzing trace with hash 262036326, now seen corresponding path program 75 times [2019-10-01 23:55:01,456 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:01,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:01,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:01,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:01,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7730 backedges. 32 proven. 6400 refuted. 0 times theorem prover too weak. 1298 trivial. 0 not checked. [2019-10-01 23:55:03,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:03,939 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:04,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:55:04,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-01 23:55:04,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:04,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 86 conjunts are in the unsatisfiable core [2019-10-01 23:55:04,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:09,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:55:09,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:09,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:09,483 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 23:55:09,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 23:55:09,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:55:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7730 backedges. 45 proven. 850 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2019-10-01 23:55:09,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:09,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 44] total 125 [2019-10-01 23:55:09,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-10-01 23:55:09,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-10-01 23:55:09,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3524, Invalid=11976, Unknown=0, NotChecked=0, Total=15500 [2019-10-01 23:55:09,892 INFO L87 Difference]: Start difference. First operand 340 states and 342 transitions. Second operand 125 states. [2019-10-01 23:55:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:27,348 INFO L93 Difference]: Finished difference Result 526 states and 531 transitions. [2019-10-01 23:55:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-10-01 23:55:27,349 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 337 [2019-10-01 23:55:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:27,350 INFO L225 Difference]: With dead ends: 526 [2019-10-01 23:55:27,351 INFO L226 Difference]: Without dead ends: 353 [2019-10-01 23:55:27,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 265 SyntacticMatches, 31 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13130 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=10475, Invalid=41281, Unknown=0, NotChecked=0, Total=51756 [2019-10-01 23:55:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-10-01 23:55:27,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 350. [2019-10-01 23:55:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-01 23:55:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 352 transitions. [2019-10-01 23:55:27,364 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 352 transitions. Word has length 337 [2019-10-01 23:55:27,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:27,364 INFO L475 AbstractCegarLoop]: Abstraction has 350 states and 352 transitions. [2019-10-01 23:55:27,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-10-01 23:55:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 352 transitions. [2019-10-01 23:55:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-10-01 23:55:27,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:27,366 INFO L411 BasicCegarLoop]: trace histogram [81, 81, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:27,366 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:27,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:27,366 INFO L82 PathProgramCache]: Analyzing trace with hash -316279109, now seen corresponding path program 76 times [2019-10-01 23:55:27,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:27,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8023 backedges. 34 proven. 6561 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-10-01 23:55:29,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:29,973 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:30,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:55:30,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:55:30,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:30,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 83 conjunts are in the unsatisfiable core [2019-10-01 23:55:30,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8023 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2019-10-01 23:55:30,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:30,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 85 [2019-10-01 23:55:30,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-01 23:55:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-01 23:55:30,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 23:55:30,519 INFO L87 Difference]: Start difference. First operand 350 states and 352 transitions. Second operand 85 states. [2019-10-01 23:55:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:30,833 INFO L93 Difference]: Finished difference Result 534 states and 538 transitions. [2019-10-01 23:55:30,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-01 23:55:30,834 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 347 [2019-10-01 23:55:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:30,835 INFO L225 Difference]: With dead ends: 534 [2019-10-01 23:55:30,835 INFO L226 Difference]: Without dead ends: 353 [2019-10-01 23:55:30,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 23:55:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-10-01 23:55:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2019-10-01 23:55:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-01 23:55:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 354 transitions. [2019-10-01 23:55:30,847 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 354 transitions. Word has length 347 [2019-10-01 23:55:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:30,847 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 354 transitions. [2019-10-01 23:55:30,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-01 23:55:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 354 transitions. [2019-10-01 23:55:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-01 23:55:30,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:30,849 INFO L411 BasicCegarLoop]: trace histogram [82, 82, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:30,849 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash 560953433, now seen corresponding path program 77 times [2019-10-01 23:55:30,849 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:30,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:30,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8186 backedges. 547 proven. 371 refuted. 0 times theorem prover too weak. 7268 trivial. 0 not checked. [2019-10-01 23:55:31,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:31,476 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:31,745 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1