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_maxInArray_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:13:54,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:13:54,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:13:54,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:13:54,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:13:54,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:13:54,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:13:54,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:13:54,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:13:54,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:13:54,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:13:54,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:13:54,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:13:54,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:13:54,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:13:54,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:13:54,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:13:54,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:13:54,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:13:54,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:13:54,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:13:54,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:13:54,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:13:54,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:13:54,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:13:54,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:13:54,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:13:54,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:13:54,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:13:54,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:13:54,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:13:54,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:13:54,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:13:54,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:13:54,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:13:54,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:13:54,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:13:54,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:13:54,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:13:54,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:13:54,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:13:54,208 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 10:13:54,222 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:13:54,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:13:54,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:13:54,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:13:54,225 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:13:54,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:13:54,225 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:13:54,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:13:54,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:13:54,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:13:54,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:13:54,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:13:54,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:13:54,227 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:13:54,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:13:54,227 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:13:54,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:13:54,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:13:54,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:13:54,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:13:54,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:13:54,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:13:54,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:13:54,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:13:54,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:13:54,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:13:54,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:13:54,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:13:54,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:13:54,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:13:54,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:13:54,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:13:54,279 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:13:54,279 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:13:54,280 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_maxInArray_ground.i [2019-09-07 10:13:54,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f187f6c74/3da803462be74c51a15f0e8ba5b79bbf/FLAG3888a48b3 [2019-09-07 10:13:54,873 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:13:54,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_maxInArray_ground.i [2019-09-07 10:13:54,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f187f6c74/3da803462be74c51a15f0e8ba5b79bbf/FLAG3888a48b3 [2019-09-07 10:13:55,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f187f6c74/3da803462be74c51a15f0e8ba5b79bbf [2019-09-07 10:13:55,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:13:55,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:13:55,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:13:55,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:13:55,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:13:55,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:13:55" (1/1) ... [2019-09-07 10:13:55,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be7fb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55, skipping insertion in model container [2019-09-07 10:13:55,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:13:55" (1/1) ... [2019-09-07 10:13:55,277 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:13:55,292 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:13:55,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:13:55,522 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:13:55,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:13:55,560 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:13:55,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55 WrapperNode [2019-09-07 10:13:55,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:13:55,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:13:55,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:13:55,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:13:55,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55" (1/1) ... [2019-09-07 10:13:55,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55" (1/1) ... [2019-09-07 10:13:55,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55" (1/1) ... [2019-09-07 10:13:55,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55" (1/1) ... [2019-09-07 10:13:55,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55" (1/1) ... [2019-09-07 10:13:55,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55" (1/1) ... [2019-09-07 10:13:55,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55" (1/1) ... [2019-09-07 10:13:55,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:13:55,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:13:55,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:13:55,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:13:55,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:13:55,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:13:55,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:13:55,765 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:13:55,765 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:13:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:13:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:13:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:13:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:13:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:13:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:13:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:13:55,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:13:55,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:13:55,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:13:56,022 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:13:56,023 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:13:56,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:13:56 BoogieIcfgContainer [2019-09-07 10:13:56,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:13:56,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:13:56,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:13:56,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:13:56,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:13:55" (1/3) ... [2019-09-07 10:13:56,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd19603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:13:56, skipping insertion in model container [2019-09-07 10:13:56,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:55" (2/3) ... [2019-09-07 10:13:56,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd19603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:13:56, skipping insertion in model container [2019-09-07 10:13:56,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:13:56" (3/3) ... [2019-09-07 10:13:56,064 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_maxInArray_ground.i [2019-09-07 10:13:56,089 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:13:56,107 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:13:56,134 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:13:56,162 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:13:56,163 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:13:56,164 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:13:56,164 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:13:56,164 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:13:56,164 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:13:56,164 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:13:56,165 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:13:56,165 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:13:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-07 10:13:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:13:56,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:56,187 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:56,189 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:56,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1241254978, now seen corresponding path program 1 times [2019-09-07 10:13:56,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:56,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:56,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:13:56,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:13:56,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:13:56,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:13:56,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:13:56,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:13:56,341 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-09-07 10:13:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:56,362 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2019-09-07 10:13:56,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:13:56,363 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 10:13:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:56,372 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:13:56,372 INFO L226 Difference]: Without dead ends: 23 [2019-09-07 10:13:56,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:13:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-07 10:13:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-07 10:13:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 10:13:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-07 10:13:56,418 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2019-09-07 10:13:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:56,419 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-07 10:13:56,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:13:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-07 10:13:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:13:56,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:56,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:56,421 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:56,421 INFO L82 PathProgramCache]: Analyzing trace with hash -159068691, now seen corresponding path program 1 times [2019-09-07 10:13:56,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:56,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:56,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:56,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:56,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:13:56,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:13:56,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:13:56,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:13:56,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:13:56,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:13:56,490 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2019-09-07 10:13:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:56,525 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-09-07 10:13:56,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:13:56,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:13:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:56,527 INFO L225 Difference]: With dead ends: 40 [2019-09-07 10:13:56,527 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 10:13:56,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:13:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 10:13:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-07 10:13:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 10:13:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-09-07 10:13:56,535 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2019-09-07 10:13:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:56,536 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-09-07 10:13:56,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:13:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-09-07 10:13:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 10:13:56,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:56,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:56,537 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1675123339, now seen corresponding path program 1 times [2019-09-07 10:13:56,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:56,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:56,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:56,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:56,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:13:56,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:13:56,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:13:56,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:13:56,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:13:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:13:56,606 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2019-09-07 10:13:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:56,627 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-09-07 10:13:56,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:13:56,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 10:13:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:56,628 INFO L225 Difference]: With dead ends: 38 [2019-09-07 10:13:56,629 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 10:13:56,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:13:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 10:13:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-09-07 10:13:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 10:13:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-07 10:13:56,635 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2019-09-07 10:13:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:56,636 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-07 10:13:56,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:13:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-07 10:13:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 10:13:56,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:56,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:56,638 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:56,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:56,638 INFO L82 PathProgramCache]: Analyzing trace with hash 99818017, now seen corresponding path program 1 times [2019-09-07 10:13:56,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:56,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:56,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:56,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:56,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:13:56,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:56,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:56,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:56,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:13:56,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:13:56,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:56,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:13:56,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:13:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:13:56,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:13:56,814 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-09-07 10:13:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:56,851 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-09-07 10:13:56,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:13:56,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-07 10:13:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:56,853 INFO L225 Difference]: With dead ends: 44 [2019-09-07 10:13:56,853 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 10:13:56,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:13:56,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 10:13:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-07 10:13:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 10:13:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-07 10:13:56,860 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2019-09-07 10:13:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:56,860 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-07 10:13:56,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:13:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-07 10:13:56,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 10:13:56,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:56,861 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:56,861 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:56,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:56,862 INFO L82 PathProgramCache]: Analyzing trace with hash -392904637, now seen corresponding path program 2 times [2019-09-07 10:13:56,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:56,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:56,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:13:56,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:56,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:56,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:13:56,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:13:56,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:56,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:13:56,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:13:57,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:57,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 10:13:57,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:13:57,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:13:57,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:13:57,011 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 7 states. [2019-09-07 10:13:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:57,088 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-09-07 10:13:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:13:57,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-07 10:13:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:57,090 INFO L225 Difference]: With dead ends: 51 [2019-09-07 10:13:57,090 INFO L226 Difference]: Without dead ends: 35 [2019-09-07 10:13:57,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:13:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-07 10:13:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-09-07 10:13:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:13:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-07 10:13:57,100 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2019-09-07 10:13:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:57,101 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-07 10:13:57,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:13:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-07 10:13:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:13:57,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:57,103 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:57,104 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1100015481, now seen corresponding path program 3 times [2019-09-07 10:13:57,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:57,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:57,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:57,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:57,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:13:57,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:57,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:13:57,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:57,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:13:57,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:57,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:13:57,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:13:57,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:57,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:13:57,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:13:57,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:13:57,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:13:57,239 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-09-07 10:13:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:57,281 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-09-07 10:13:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:13:57,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-09-07 10:13:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:57,283 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:13:57,283 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 10:13:57,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:13:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 10:13:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-07 10:13:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 10:13:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-09-07 10:13:57,291 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 27 [2019-09-07 10:13:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:57,292 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-09-07 10:13:57,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:13:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-09-07 10:13:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 10:13:57,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:57,295 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:57,296 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:57,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:57,296 INFO L82 PathProgramCache]: Analyzing trace with hash -235287899, now seen corresponding path program 4 times [2019-09-07 10:13:57,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:57,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:57,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:57,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:57,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 10:13:57,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:57,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:13:57,444 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:57,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:13:57,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:57,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:13:57,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 10:13:57,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:57,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:13:57,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:13:57,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:13:57,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:13:57,495 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 7 states. [2019-09-07 10:13:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:57,529 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-09-07 10:13:57,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:13:57,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-07 10:13:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:57,530 INFO L225 Difference]: With dead ends: 60 [2019-09-07 10:13:57,530 INFO L226 Difference]: Without dead ends: 38 [2019-09-07 10:13:57,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-09-07 10:13:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-07 10:13:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-07 10:13:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 10:13:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-09-07 10:13:57,537 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 30 [2019-09-07 10:13:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:57,538 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-09-07 10:13:57,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:13:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-09-07 10:13:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 10:13:57,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:57,539 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:57,539 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:57,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash -777802169, now seen corresponding path program 5 times [2019-09-07 10:13:57,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:57,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:57,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:13:57,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:57,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:57,626 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:13:57,659 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 10:13:57,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:57,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:13:57,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:13:57,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:57,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:13:57,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:13:57,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:13:57,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:13:57,687 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 7 states. [2019-09-07 10:13:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:57,730 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-09-07 10:13:57,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:13:57,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-09-07 10:13:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:57,731 INFO L225 Difference]: With dead ends: 53 [2019-09-07 10:13:57,732 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 10:13:57,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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-09-07 10:13:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 10:13:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-07 10:13:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:13:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-09-07 10:13:57,738 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2019-09-07 10:13:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:57,738 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-09-07 10:13:57,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:13:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-09-07 10:13:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 10:13:57,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:57,740 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:57,740 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash -430416667, now seen corresponding path program 6 times [2019-09-07 10:13:57,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:57,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:57,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:57,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:57,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 10:13:57,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:57,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:57,823 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:13:57,851 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 10:13:57,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:57,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:13:57,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 10:13:57,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:57,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:13:57,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:13:57,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:13:57,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:13:57,876 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-09-07 10:13:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:57,927 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2019-09-07 10:13:57,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:13:57,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-07 10:13:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:57,929 INFO L225 Difference]: With dead ends: 68 [2019-09-07 10:13:57,929 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 10:13:57,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:13:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 10:13:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-07 10:13:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 10:13:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-09-07 10:13:57,935 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 35 [2019-09-07 10:13:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:57,936 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-09-07 10:13:57,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:13:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-09-07 10:13:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 10:13:57,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:57,937 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:57,938 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:57,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash -657101181, now seen corresponding path program 7 times [2019-09-07 10:13:57,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:57,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:57,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:13:58,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:58,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:58,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:58,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:13:58,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 10:13:58,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:58,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 10:13:58,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:13:58,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:13:58,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:13:58,144 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 13 states. [2019-09-07 10:13:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:58,239 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-09-07 10:13:58,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:13:58,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-09-07 10:13:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:58,241 INFO L225 Difference]: With dead ends: 75 [2019-09-07 10:13:58,241 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 10:13:58,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:13:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 10:13:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-07 10:13:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 10:13:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-09-07 10:13:58,254 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 37 [2019-09-07 10:13:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:58,254 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-09-07 10:13:58,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:13:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-09-07 10:13:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 10:13:58,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:58,259 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:58,259 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:58,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:58,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1082991691, now seen corresponding path program 8 times [2019-09-07 10:13:58,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:58,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:58,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:58,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:58,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:13:58,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:58,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:58,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:13:58,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:13:58,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:58,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:13:58,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 10:13:58,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:58,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 10:13:58,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:13:58,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:13:58,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:13:58,591 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 15 states. [2019-09-07 10:13:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:58,696 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-09-07 10:13:58,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:13:58,697 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2019-09-07 10:13:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:58,698 INFO L225 Difference]: With dead ends: 83 [2019-09-07 10:13:58,698 INFO L226 Difference]: Without dead ends: 55 [2019-09-07 10:13:58,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:13:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-07 10:13:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-09-07 10:13:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 10:13:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-09-07 10:13:58,714 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 42 [2019-09-07 10:13:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:58,714 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-09-07 10:13:58,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:13:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-09-07 10:13:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:13:58,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:58,718 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:58,719 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:58,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1481171841, now seen corresponding path program 9 times [2019-09-07 10:13:58,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:58,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:58,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 10:13:58,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:58,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:58,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:13:58,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:13:58,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:58,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:13:58,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:59,019 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-09-07 10:13:59,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:13:59,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:13:59,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:13:59,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:13:59,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:13:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-07 10:13:59,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:59,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-09-07 10:13:59,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:13:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:13:59,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:13:59,085 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 17 states. [2019-09-07 10:13:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:59,581 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2019-09-07 10:13:59,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:13:59,582 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2019-09-07 10:13:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:59,585 INFO L225 Difference]: With dead ends: 100 [2019-09-07 10:13:59,585 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 10:13:59,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=799, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:13:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 10:13:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-09-07 10:13:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 10:13:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2019-09-07 10:13:59,610 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 47 [2019-09-07 10:13:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:59,610 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2019-09-07 10:13:59,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:13:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2019-09-07 10:13:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 10:13:59,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:59,612 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:59,612 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:59,612 INFO L82 PathProgramCache]: Analyzing trace with hash -50936405, now seen corresponding path program 1 times [2019-09-07 10:13:59,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:59,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:59,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:59,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:59,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 10:13:59,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:59,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:13:59,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:59,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:13:59,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 10:13:59,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:59,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:13:59,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:13:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:13:59,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:13:59,822 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 11 states. [2019-09-07 10:13:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:59,865 INFO L93 Difference]: Finished difference Result 140 states and 170 transitions. [2019-09-07 10:13:59,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:13:59,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-07 10:13:59,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:59,868 INFO L225 Difference]: With dead ends: 140 [2019-09-07 10:13:59,868 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 10:13:59,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 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-09-07 10:13:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 10:13:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-07 10:13:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 10:13:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2019-09-07 10:13:59,877 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 50 [2019-09-07 10:13:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:59,878 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2019-09-07 10:13:59,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:13:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2019-09-07 10:13:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 10:13:59,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:59,881 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:59,881 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:59,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash 144475213, now seen corresponding path program 2 times [2019-09-07 10:13:59,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:59,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:59,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 10:14:00,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:00,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:00,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:14:00,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:00,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:00,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:14:00,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 10:14:00,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:00,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 10:14:00,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:14:00,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:14:00,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:14:00,185 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 19 states. [2019-09-07 10:14:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:00,294 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2019-09-07 10:14:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:14:00,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2019-09-07 10:14:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:00,296 INFO L225 Difference]: With dead ends: 152 [2019-09-07 10:14:00,296 INFO L226 Difference]: Without dead ends: 94 [2019-09-07 10:14:00,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:14:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-07 10:14:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2019-09-07 10:14:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 10:14:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2019-09-07 10:14:00,305 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 52 [2019-09-07 10:14:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:00,306 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2019-09-07 10:14:00,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:14:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2019-09-07 10:14:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 10:14:00,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:00,307 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:00,307 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:00,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1254685575, now seen corresponding path program 3 times [2019-09-07 10:14:00,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:00,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:00,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:00,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:00,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 10:14:00,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:00,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:00,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:00,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:14:00,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:00,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:14:00,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:00,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:00,610 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 32 treesize of output 22 [2019-09-07 10:14:00,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:00,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:14:00,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:00,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:14:00,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 10:14:00,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:14:00,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:00,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-07 10:14:00,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:14:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:14:00,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:14:00,686 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand 21 states. [2019-09-07 10:14:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:02,088 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2019-09-07 10:14:02,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 10:14:02,088 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-09-07 10:14:02,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:02,091 INFO L225 Difference]: With dead ends: 129 [2019-09-07 10:14:02,091 INFO L226 Difference]: Without dead ends: 111 [2019-09-07 10:14:02,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=705, Invalid=2487, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:14:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-07 10:14:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2019-09-07 10:14:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 10:14:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-09-07 10:14:02,101 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2019-09-07 10:14:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:02,102 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-09-07 10:14:02,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:14:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-09-07 10:14:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 10:14:02,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:02,103 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:02,103 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash 995106664, now seen corresponding path program 1 times [2019-09-07 10:14:02,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:02,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:02,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:02,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-07 10:14:02,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:02,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:02,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:02,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:14:02,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 10:14:02,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:02,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:14:02,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:14:02,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:14:02,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:14:02,314 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 13 states. [2019-09-07 10:14:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:02,378 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2019-09-07 10:14:02,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:14:02,379 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-09-07 10:14:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:02,380 INFO L225 Difference]: With dead ends: 120 [2019-09-07 10:14:02,380 INFO L226 Difference]: Without dead ends: 74 [2019-09-07 10:14:02,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:14:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-07 10:14:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-07 10:14:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-07 10:14:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-09-07 10:14:02,391 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 68 [2019-09-07 10:14:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:02,391 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-09-07 10:14:02,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:14:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-09-07 10:14:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 10:14:02,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:02,392 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:02,393 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash 571750794, now seen corresponding path program 2 times [2019-09-07 10:14:02,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:02,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 2 proven. 117 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-07 10:14:02,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:02,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:02,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:02,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:02,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:02,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:14:02,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 10:14:02,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:02,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-09-07 10:14:02,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:14:02,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:14:02,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:14:02,717 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 23 states. [2019-09-07 10:14:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:02,840 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2019-09-07 10:14:02,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:14:02,841 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2019-09-07 10:14:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:02,842 INFO L225 Difference]: With dead ends: 127 [2019-09-07 10:14:02,842 INFO L226 Difference]: Without dead ends: 81 [2019-09-07 10:14:02,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:14:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-07 10:14:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2019-09-07 10:14:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-07 10:14:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2019-09-07 10:14:02,850 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 70 [2019-09-07 10:14:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:02,851 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2019-09-07 10:14:02,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:14:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2019-09-07 10:14:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:14:02,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:02,852 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:02,852 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2085179986, now seen corresponding path program 3 times [2019-09-07 10:14:02,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:02,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:02,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:02,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 2 proven. 145 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-07 10:14:02,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:02,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:02,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:03,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 10:14:03,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:03,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:14:03,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:03,184 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-09-07 10:14:03,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:14:03,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:03,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:14:03,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:14:03,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-09-07 10:14:03,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:03,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 10:14:03,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:14:03,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:14:03,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:14:03,246 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 25 states. [2019-09-07 10:14:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:04,065 INFO L93 Difference]: Finished difference Result 145 states and 174 transitions. [2019-09-07 10:14:04,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:14:04,065 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2019-09-07 10:14:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:04,066 INFO L225 Difference]: With dead ends: 145 [2019-09-07 10:14:04,066 INFO L226 Difference]: Without dead ends: 128 [2019-09-07 10:14:04,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=514, Invalid=2036, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:14:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-07 10:14:04,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 118. [2019-09-07 10:14:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-07 10:14:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2019-09-07 10:14:04,077 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 75 [2019-09-07 10:14:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:04,078 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-09-07 10:14:04,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:14:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2019-09-07 10:14:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 10:14:04,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:04,080 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:04,080 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1854631914, now seen corresponding path program 1 times [2019-09-07 10:14:04,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:04,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:04,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:04,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:04,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 2 proven. 121 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-09-07 10:14:04,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:04,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:04,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:04,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:14:04,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-07 10:14:04,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:04,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:14:04,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:14:04,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:14:04,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:14:04,296 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand 15 states. [2019-09-07 10:14:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:04,346 INFO L93 Difference]: Finished difference Result 210 states and 256 transitions. [2019-09-07 10:14:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:14:04,346 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2019-09-07 10:14:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:04,347 INFO L225 Difference]: With dead ends: 210 [2019-09-07 10:14:04,347 INFO L226 Difference]: Without dead ends: 121 [2019-09-07 10:14:04,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:14:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-07 10:14:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-09-07 10:14:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-07 10:14:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2019-09-07 10:14:04,357 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 78 [2019-09-07 10:14:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:04,358 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2019-09-07 10:14:04,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:14:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2019-09-07 10:14:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 10:14:04,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:04,359 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:04,359 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:04,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1328101492, now seen corresponding path program 2 times [2019-09-07 10:14:04,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:04,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:04,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:04,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:04,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 2 proven. 176 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-07 10:14:04,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:04,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:04,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:14:04,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:04,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:04,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:14:04,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-07 10:14:04,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-09-07 10:14:04,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:14:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:14:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:14:04,749 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand 27 states. [2019-09-07 10:14:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:04,876 INFO L93 Difference]: Finished difference Result 222 states and 274 transitions. [2019-09-07 10:14:04,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:14:04,876 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2019-09-07 10:14:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:04,877 INFO L225 Difference]: With dead ends: 222 [2019-09-07 10:14:04,877 INFO L226 Difference]: Without dead ends: 133 [2019-09-07 10:14:04,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:14:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-07 10:14:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2019-09-07 10:14:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-07 10:14:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 153 transitions. [2019-09-07 10:14:04,887 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 153 transitions. Word has length 80 [2019-09-07 10:14:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:04,888 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 153 transitions. [2019-09-07 10:14:04,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:14:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2019-09-07 10:14:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 10:14:04,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:04,889 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:04,889 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:04,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2028639320, now seen corresponding path program 3 times [2019-09-07 10:14:04,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:04,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:04,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:04,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:04,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 210 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 10:14:05,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:05,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:05,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:05,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 10:14:05,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:05,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:14:05,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:05,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:05,515 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 32 treesize of output 22 [2019-09-07 10:14:05,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:05,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:14:05,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:05,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:14:05,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 10:14:05,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 29 proven. 59 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-09-07 10:14:05,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:05,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2019-09-07 10:14:05,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:14:05,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:14:05,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:14:05,613 INFO L87 Difference]: Start difference. First operand 128 states and 153 transitions. Second operand 30 states. [2019-09-07 10:14:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:07,881 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2019-09-07 10:14:07,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 10:14:07,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2019-09-07 10:14:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:07,884 INFO L225 Difference]: With dead ends: 190 [2019-09-07 10:14:07,884 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 10:14:07,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1263, Invalid=5057, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 10:14:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 10:14:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 99. [2019-09-07 10:14:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-07 10:14:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2019-09-07 10:14:07,903 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 85 [2019-09-07 10:14:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:07,903 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2019-09-07 10:14:07,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:14:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2019-09-07 10:14:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 10:14:07,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:07,905 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:07,905 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:07,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:07,905 INFO L82 PathProgramCache]: Analyzing trace with hash 343721127, now seen corresponding path program 4 times [2019-09-07 10:14:07,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:07,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:07,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:07,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 4 proven. 169 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-07 10:14:08,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:08,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:08,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:14:08,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:08,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:08,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:14:08,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-09-07 10:14:08,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:08,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:14:08,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:14:08,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:14:08,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:14:08,201 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 17 states. [2019-09-07 10:14:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:08,250 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2019-09-07 10:14:08,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:14:08,252 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-09-07 10:14:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:08,254 INFO L225 Difference]: With dead ends: 168 [2019-09-07 10:14:08,254 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 10:14:08,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:14:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 10:14:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-07 10:14:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 10:14:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-09-07 10:14:08,262 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 96 [2019-09-07 10:14:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:08,262 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-09-07 10:14:08,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:14:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-09-07 10:14:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 10:14:08,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:08,264 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:08,264 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2028849207, now seen corresponding path program 5 times [2019-09-07 10:14:08,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:08,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:08,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:08,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:08,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 4 proven. 247 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-09-07 10:14:08,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:08,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:08,443 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:14:08,693 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-09-07 10:14:08,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:08,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:14:08,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-09-07 10:14:08,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:08,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-09-07 10:14:08,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:14:08,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:14:08,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:14:08,984 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 31 states. [2019-09-07 10:14:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:09,187 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2019-09-07 10:14:09,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:14:09,187 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 98 [2019-09-07 10:14:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:09,189 INFO L225 Difference]: With dead ends: 175 [2019-09-07 10:14:09,189 INFO L226 Difference]: Without dead ends: 109 [2019-09-07 10:14:09,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:14:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-07 10:14:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-09-07 10:14:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-07 10:14:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2019-09-07 10:14:09,203 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 98 [2019-09-07 10:14:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:09,204 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2019-09-07 10:14:09,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:14:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2019-09-07 10:14:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 10:14:09,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:09,206 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:09,207 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:09,207 INFO L82 PathProgramCache]: Analyzing trace with hash 261130205, now seen corresponding path program 6 times [2019-09-07 10:14:09,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:09,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:09,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:09,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:09,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 4 proven. 287 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-09-07 10:14:09,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:09,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:09,461 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:09,840 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-07 10:14:09,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:09,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:14:09,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-09-07 10:14:09,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:09,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:14:09,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:14:09,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:14:09,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:14:09,875 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 18 states. [2019-09-07 10:14:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:09,960 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2019-09-07 10:14:09,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:14:09,961 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 103 [2019-09-07 10:14:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:09,962 INFO L225 Difference]: With dead ends: 136 [2019-09-07 10:14:09,962 INFO L226 Difference]: Without dead ends: 111 [2019-09-07 10:14:09,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:14:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-07 10:14:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-09-07 10:14:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-07 10:14:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-09-07 10:14:09,970 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 103 [2019-09-07 10:14:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:09,971 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-09-07 10:14:09,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:14:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-09-07 10:14:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 10:14:09,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:09,972 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:09,973 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:09,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1730536149, now seen corresponding path program 7 times [2019-09-07 10:14:09,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:09,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 4 proven. 225 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-07 10:14:10,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:10,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:10,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:10,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:14:10,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:10,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:10,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 10:14:10,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:14:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:14:10,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:14:10,282 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 19 states. [2019-09-07 10:14:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:10,348 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2019-09-07 10:14:10,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:14:10,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 106 [2019-09-07 10:14:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:10,350 INFO L225 Difference]: With dead ends: 184 [2019-09-07 10:14:10,350 INFO L226 Difference]: Without dead ends: 112 [2019-09-07 10:14:10,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 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-09-07 10:14:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-07 10:14:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-07 10:14:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-07 10:14:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2019-09-07 10:14:10,359 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 106 [2019-09-07 10:14:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:10,359 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2019-09-07 10:14:10,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:14:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2019-09-07 10:14:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-07 10:14:10,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:10,360 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:10,361 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash 400264653, now seen corresponding path program 8 times [2019-09-07 10:14:10,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:10,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:10,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:10,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:10,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 4 proven. 330 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-07 10:14:10,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:10,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:10,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:14:10,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:10,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:10,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:14:10,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-07 10:14:10,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:10,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2019-09-07 10:14:10,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:14:10,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:14:10,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:14:10,855 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 35 states. [2019-09-07 10:14:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:11,058 INFO L93 Difference]: Finished difference Result 191 states and 228 transitions. [2019-09-07 10:14:11,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:14:11,059 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 108 [2019-09-07 10:14:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:11,061 INFO L225 Difference]: With dead ends: 191 [2019-09-07 10:14:11,061 INFO L226 Difference]: Without dead ends: 119 [2019-09-07 10:14:11,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:14:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-07 10:14:11,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-09-07 10:14:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-07 10:14:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2019-09-07 10:14:11,072 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 108 [2019-09-07 10:14:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:11,073 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2019-09-07 10:14:11,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:14:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2019-09-07 10:14:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 10:14:11,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:11,074 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:11,074 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:11,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1741179431, now seen corresponding path program 9 times [2019-09-07 10:14:11,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:11,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:11,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:11,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:11,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 4 proven. 376 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-07 10:14:11,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:11,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:11,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:14:11,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:14:11,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:11,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:14:11,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:11,633 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-09-07 10:14:11,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:14:11,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:11,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:14:11,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:14:11,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 6 proven. 125 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-09-07 10:14:11,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:11,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-09-07 10:14:11,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:14:11,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:14:11,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:14:11,713 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 33 states. [2019-09-07 10:14:12,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:12,997 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2019-09-07 10:14:12,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:14:12,997 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 113 [2019-09-07 10:14:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:13,000 INFO L225 Difference]: With dead ends: 210 [2019-09-07 10:14:13,000 INFO L226 Difference]: Without dead ends: 185 [2019-09-07 10:14:13,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1023, Invalid=3807, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 10:14:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-07 10:14:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 175. [2019-09-07 10:14:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-07 10:14:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 210 transitions. [2019-09-07 10:14:13,015 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 210 transitions. Word has length 113 [2019-09-07 10:14:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:13,015 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 210 transitions. [2019-09-07 10:14:13,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:14:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 210 transitions. [2019-09-07 10:14:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 10:14:13,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:13,017 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:13,017 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:13,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash 123323309, now seen corresponding path program 4 times [2019-09-07 10:14:13,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:13,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:13,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:13,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:13,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 4 proven. 289 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2019-09-07 10:14:13,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:13,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:13,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:14:13,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:13,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:13,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:14:13,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 10:14:13,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:13,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:14:13,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:14:13,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:14:13,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:14:13,313 INFO L87 Difference]: Start difference. First operand 175 states and 210 transitions. Second operand 21 states. [2019-09-07 10:14:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:13,390 INFO L93 Difference]: Finished difference Result 312 states and 382 transitions. [2019-09-07 10:14:13,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:14:13,391 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 116 [2019-09-07 10:14:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:13,392 INFO L225 Difference]: With dead ends: 312 [2019-09-07 10:14:13,392 INFO L226 Difference]: Without dead ends: 178 [2019-09-07 10:14:13,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:14:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-07 10:14:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-07 10:14:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-07 10:14:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 212 transitions. [2019-09-07 10:14:13,407 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 212 transitions. Word has length 116 [2019-09-07 10:14:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:13,407 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 212 transitions. [2019-09-07 10:14:13,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:14:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 212 transitions. [2019-09-07 10:14:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-07 10:14:13,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:13,409 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 16, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:13,410 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:13,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1073196593, now seen corresponding path program 5 times [2019-09-07 10:14:13,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:13,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:13,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:13,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:13,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 4 proven. 425 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-09-07 10:14:13,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:13,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:14:13,984 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 10:14:13,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:13,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:14:13,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 10:14:14,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:14,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 10:14:14,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:14:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:14:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:14:14,311 INFO L87 Difference]: Start difference. First operand 177 states and 212 transitions. Second operand 39 states. [2019-09-07 10:14:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:14,538 INFO L93 Difference]: Finished difference Result 324 states and 400 transitions. [2019-09-07 10:14:14,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:14:14,539 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2019-09-07 10:14:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:14,541 INFO L225 Difference]: With dead ends: 324 [2019-09-07 10:14:14,541 INFO L226 Difference]: Without dead ends: 190 [2019-09-07 10:14:14,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:14:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-07 10:14:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185. [2019-09-07 10:14:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-07 10:14:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2019-09-07 10:14:14,565 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 118 [2019-09-07 10:14:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:14,566 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2019-09-07 10:14:14,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:14:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2019-09-07 10:14:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 10:14:14,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:14,568 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 17, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:14,568 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1146102227, now seen corresponding path program 6 times [2019-09-07 10:14:14,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:14,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:14,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 4 proven. 477 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2019-09-07 10:14:14,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:14,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:14,951 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:15,249 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-07 10:14:15,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:15,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:14:15,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:15,714 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:15,714 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 32 treesize of output 22 [2019-09-07 10:14:15,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:15,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:14:15,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:15,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:14:15,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 10:14:15,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 47 proven. 144 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-09-07 10:14:15,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:15,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2019-09-07 10:14:15,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 10:14:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 10:14:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1084, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:14:15,815 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand 38 states. [2019-09-07 10:14:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:19,096 INFO L93 Difference]: Finished difference Result 263 states and 307 transitions. [2019-09-07 10:14:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-07 10:14:19,097 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 123 [2019-09-07 10:14:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:19,099 INFO L225 Difference]: With dead ends: 263 [2019-09-07 10:14:19,099 INFO L226 Difference]: Without dead ends: 223 [2019-09-07 10:14:19,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3820 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2401, Invalid=9155, Unknown=0, NotChecked=0, Total=11556 [2019-09-07 10:14:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-07 10:14:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 137. [2019-09-07 10:14:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-07 10:14:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-09-07 10:14:19,116 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 123 [2019-09-07 10:14:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:19,116 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-09-07 10:14:19,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 10:14:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-09-07 10:14:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-07 10:14:19,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:19,118 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:19,119 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1314818198, now seen corresponding path program 10 times [2019-09-07 10:14:19,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:19,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:19,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:19,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:19,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 6 proven. 361 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-09-07 10:14:19,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:19,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:19,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:14:19,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:19,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:19,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:14:19,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2019-09-07 10:14:19,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:19,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:14:19,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:14:19,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:14:19,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:14:19,484 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 23 states. [2019-09-07 10:14:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:19,561 INFO L93 Difference]: Finished difference Result 232 states and 274 transitions. [2019-09-07 10:14:19,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:14:19,562 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 134 [2019-09-07 10:14:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:19,563 INFO L225 Difference]: With dead ends: 232 [2019-09-07 10:14:19,563 INFO L226 Difference]: Without dead ends: 140 [2019-09-07 10:14:19,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 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-09-07 10:14:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-07 10:14:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-07 10:14:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-07 10:14:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2019-09-07 10:14:19,574 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 134 [2019-09-07 10:14:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:19,574 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2019-09-07 10:14:19,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:14:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2019-09-07 10:14:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 10:14:19,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:19,575 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:19,576 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:19,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1381400308, now seen corresponding path program 11 times [2019-09-07 10:14:19,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:19,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:19,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:19,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:19,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 6 proven. 532 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2019-09-07 10:14:19,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:19,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:19,819 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:14:20,640 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-09-07 10:14:20,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:20,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:14:20,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-09-07 10:14:20,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:20,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:14:20,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:14:20,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:14:20,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:14:20,673 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand 23 states. [2019-09-07 10:14:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:20,774 INFO L93 Difference]: Finished difference Result 177 states and 201 transitions. [2019-09-07 10:14:20,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:14:20,775 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 136 [2019-09-07 10:14:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:20,776 INFO L225 Difference]: With dead ends: 177 [2019-09-07 10:14:20,777 INFO L226 Difference]: Without dead ends: 144 [2019-09-07 10:14:20,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:14:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-07 10:14:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-09-07 10:14:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-07 10:14:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 164 transitions. [2019-09-07 10:14:20,789 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 164 transitions. Word has length 136 [2019-09-07 10:14:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:20,790 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 164 transitions. [2019-09-07 10:14:20,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:14:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 164 transitions. [2019-09-07 10:14:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-07 10:14:20,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:20,792 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:20,792 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash -94248598, now seen corresponding path program 12 times [2019-09-07 10:14:20,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:20,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:20,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 6 proven. 400 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2019-09-07 10:14:21,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:21,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:21,057 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:14:21,741 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-09-07 10:14:21,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:21,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:14:21,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:22,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:22,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2019-09-07 10:14:22,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 10:14:22,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 10:14:22,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:14:22,287 INFO L87 Difference]: Start difference. First operand 142 states and 164 transitions. Second operand 44 states. [2019-09-07 10:14:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:22,586 INFO L93 Difference]: Finished difference Result 245 states and 292 transitions. [2019-09-07 10:14:22,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:14:22,587 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 139 [2019-09-07 10:14:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:22,588 INFO L225 Difference]: With dead ends: 245 [2019-09-07 10:14:22,588 INFO L226 Difference]: Without dead ends: 150 [2019-09-07 10:14:22,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:14:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-07 10:14:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-09-07 10:14:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-07 10:14:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2019-09-07 10:14:22,602 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 139 [2019-09-07 10:14:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:22,602 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2019-09-07 10:14:22,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 10:14:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2019-09-07 10:14:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 10:14:22,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:22,604 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:22,604 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:22,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1380613138, now seen corresponding path program 13 times [2019-09-07 10:14:22,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:22,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:22,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:22,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:22,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 6 proven. 441 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2019-09-07 10:14:22,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:22,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:23,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:23,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:14:23,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-09-07 10:14:23,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:23,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:14:23,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:14:23,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:14:23,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:14:23,106 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand 25 states. [2019-09-07 10:14:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:23,187 INFO L93 Difference]: Finished difference Result 248 states and 294 transitions. [2019-09-07 10:14:23,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:14:23,187 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 144 [2019-09-07 10:14:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:23,189 INFO L225 Difference]: With dead ends: 248 [2019-09-07 10:14:23,189 INFO L226 Difference]: Without dead ends: 150 [2019-09-07 10:14:23,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:14:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-07 10:14:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-07 10:14:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-07 10:14:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-09-07 10:14:23,200 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 144 [2019-09-07 10:14:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:23,200 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-09-07 10:14:23,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:14:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-09-07 10:14:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-07 10:14:23,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:23,201 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:23,202 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2101384432, now seen corresponding path program 14 times [2019-09-07 10:14:23,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:23,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:23,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 6 proven. 651 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-09-07 10:14:23,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:23,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:23,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:14:23,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:23,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:23,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:14:23,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-09-07 10:14:24,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:24,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2019-09-07 10:14:24,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:14:24,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:14:24,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:14:24,070 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 47 states. [2019-09-07 10:14:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:24,353 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2019-09-07 10:14:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:14:24,353 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 146 [2019-09-07 10:14:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:24,355 INFO L225 Difference]: With dead ends: 255 [2019-09-07 10:14:24,355 INFO L226 Difference]: Without dead ends: 157 [2019-09-07 10:14:24,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:14:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-07 10:14:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2019-09-07 10:14:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-07 10:14:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2019-09-07 10:14:24,377 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 146 [2019-09-07 10:14:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:24,377 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2019-09-07 10:14:24,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:14:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2019-09-07 10:14:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 10:14:24,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:24,379 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:24,380 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:24,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:24,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1302382340, now seen corresponding path program 15 times [2019-09-07 10:14:24,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:24,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:24,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:24,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:24,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 6 proven. 715 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-09-07 10:14:24,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:24,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:24,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:14:25,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 10:14:25,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:25,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:14:25,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:25,345 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-09-07 10:14:25,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:14:25,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:25,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:14:25,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:14:25,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 11 proven. 239 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-09-07 10:14:25,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:25,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 41 [2019-09-07 10:14:25,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:14:25,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:14:25,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1207, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:14:25,452 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 41 states. [2019-09-07 10:14:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:27,489 INFO L93 Difference]: Finished difference Result 275 states and 328 transitions. [2019-09-07 10:14:27,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 10:14:27,490 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 151 [2019-09-07 10:14:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:27,493 INFO L225 Difference]: With dead ends: 275 [2019-09-07 10:14:27,493 INFO L226 Difference]: Without dead ends: 242 [2019-09-07 10:14:27,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1714, Invalid=6118, Unknown=0, NotChecked=0, Total=7832 [2019-09-07 10:14:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-07 10:14:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 232. [2019-09-07 10:14:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-07 10:14:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 279 transitions. [2019-09-07 10:14:27,510 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 279 transitions. Word has length 151 [2019-09-07 10:14:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:27,510 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 279 transitions. [2019-09-07 10:14:27,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:14:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 279 transitions. [2019-09-07 10:14:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 10:14:27,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:27,512 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:27,512 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:27,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1730789488, now seen corresponding path program 7 times [2019-09-07 10:14:27,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:27,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:27,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 6 proven. 529 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-07 10:14:28,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:28,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:28,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:28,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:14:28,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2019-09-07 10:14:28,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:28,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:14:28,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:14:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:14:28,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:14:28,172 INFO L87 Difference]: Start difference. First operand 232 states and 279 transitions. Second operand 27 states. [2019-09-07 10:14:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:28,280 INFO L93 Difference]: Finished difference Result 414 states and 508 transitions. [2019-09-07 10:14:28,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:14:28,280 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2019-09-07 10:14:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:28,282 INFO L225 Difference]: With dead ends: 414 [2019-09-07 10:14:28,282 INFO L226 Difference]: Without dead ends: 235 [2019-09-07 10:14:28,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:14:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-07 10:14:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2019-09-07 10:14:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-07 10:14:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 281 transitions. [2019-09-07 10:14:28,298 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 281 transitions. Word has length 154 [2019-09-07 10:14:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:28,299 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 281 transitions. [2019-09-07 10:14:28,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:14:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 281 transitions. [2019-09-07 10:14:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 10:14:28,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:28,300 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 22, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:28,301 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:28,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1755227410, now seen corresponding path program 8 times [2019-09-07 10:14:28,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:28,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:28,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:28,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:28,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 6 proven. 782 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-07 10:14:28,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:28,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:28,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:28,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:28,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:28,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:14:28,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2019-09-07 10:14:29,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:29,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-09-07 10:14:29,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:14:29,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:14:29,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:14:29,559 INFO L87 Difference]: Start difference. First operand 234 states and 281 transitions. Second operand 51 states. [2019-09-07 10:14:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:29,809 INFO L93 Difference]: Finished difference Result 426 states and 526 transitions. [2019-09-07 10:14:29,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:14:29,814 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 156 [2019-09-07 10:14:29,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:29,816 INFO L225 Difference]: With dead ends: 426 [2019-09-07 10:14:29,816 INFO L226 Difference]: Without dead ends: 247 [2019-09-07 10:14:29,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:14:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-07 10:14:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 242. [2019-09-07 10:14:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-07 10:14:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2019-09-07 10:14:29,833 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 291 transitions. Word has length 156 [2019-09-07 10:14:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:29,833 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 291 transitions. [2019-09-07 10:14:29,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:14:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 291 transitions. [2019-09-07 10:14:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-07 10:14:29,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:29,834 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 23, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:29,835 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:29,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:29,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1223074046, now seen corresponding path program 9 times [2019-09-07 10:14:29,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:29,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:29,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:29,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:29,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 6 proven. 852 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-09-07 10:14:30,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:30,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:30,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:30,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 10:14:30,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:30,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:14:30,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:31,028 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:31,029 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 32 treesize of output 22 [2019-09-07 10:14:31,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:31,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:14:31,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:31,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:14:31,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 10:14:31,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 65 proven. 266 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2019-09-07 10:14:31,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:31,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 46 [2019-09-07 10:14:31,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 10:14:31,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 10:14:31,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=1558, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:14:31,202 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. Second operand 46 states. [2019-09-07 10:14:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:35,950 INFO L93 Difference]: Finished difference Result 336 states and 392 transitions. [2019-09-07 10:14:35,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-07 10:14:35,950 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 161 [2019-09-07 10:14:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:35,952 INFO L225 Difference]: With dead ends: 336 [2019-09-07 10:14:35,953 INFO L226 Difference]: Without dead ends: 284 [2019-09-07 10:14:35,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6372 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3911, Invalid=14449, Unknown=0, NotChecked=0, Total=18360 [2019-09-07 10:14:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-07 10:14:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 175. [2019-09-07 10:14:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-07 10:14:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2019-09-07 10:14:35,967 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 161 [2019-09-07 10:14:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:35,968 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2019-09-07 10:14:35,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 10:14:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2019-09-07 10:14:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 10:14:35,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:35,969 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:35,970 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1836903635, now seen corresponding path program 16 times [2019-09-07 10:14:35,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:35,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:35,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 8 proven. 625 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2019-09-07 10:14:36,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:36,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:36,436 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:36,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:36,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:36,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:14:36,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 989 trivial. 0 not checked. [2019-09-07 10:14:36,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:36,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:14:36,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:14:36,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:14:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:14:36,548 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand 29 states. [2019-09-07 10:14:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:36,643 INFO L93 Difference]: Finished difference Result 296 states and 350 transitions. [2019-09-07 10:14:36,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:14:36,643 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 172 [2019-09-07 10:14:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:36,645 INFO L225 Difference]: With dead ends: 296 [2019-09-07 10:14:36,645 INFO L226 Difference]: Without dead ends: 178 [2019-09-07 10:14:36,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:14:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-07 10:14:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-07 10:14:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-07 10:14:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2019-09-07 10:14:36,659 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 172 [2019-09-07 10:14:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:36,660 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2019-09-07 10:14:36,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:14:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2019-09-07 10:14:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-07 10:14:36,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:36,661 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:36,662 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:36,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2082942129, now seen corresponding path program 17 times [2019-09-07 10:14:36,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:36,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:36,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:36,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:36,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 8 proven. 925 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-07 10:14:37,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:37,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:37,058 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:14:38,745 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-09-07 10:14:38,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:38,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:14:38,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:38,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:38,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:14:38,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:14:38,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:14:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:14:38,797 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand 29 states. [2019-09-07 10:14:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:38,936 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2019-09-07 10:14:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:14:38,936 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 174 [2019-09-07 10:14:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:38,937 INFO L225 Difference]: With dead ends: 223 [2019-09-07 10:14:38,937 INFO L226 Difference]: Without dead ends: 182 [2019-09-07 10:14:38,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 174 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-09-07 10:14:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-07 10:14:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-09-07 10:14:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-07 10:14:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2019-09-07 10:14:38,950 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 174 [2019-09-07 10:14:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:38,950 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2019-09-07 10:14:38,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:14:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2019-09-07 10:14:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-07 10:14:38,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:38,952 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:38,952 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:38,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1563694613, now seen corresponding path program 18 times [2019-09-07 10:14:38,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:38,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:38,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:38,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:38,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 8 proven. 676 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2019-09-07 10:14:39,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:39,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:39,319 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:14:41,236 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-09-07 10:14:41,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:41,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:14:41,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2019-09-07 10:14:41,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:41,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2019-09-07 10:14:41,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 10:14:41,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 10:14:41,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:14:41,885 INFO L87 Difference]: Start difference. First operand 180 states and 208 transitions. Second operand 56 states. [2019-09-07 10:14:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:42,175 INFO L93 Difference]: Finished difference Result 309 states and 368 transitions. [2019-09-07 10:14:42,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 10:14:42,175 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 177 [2019-09-07 10:14:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:42,177 INFO L225 Difference]: With dead ends: 309 [2019-09-07 10:14:42,177 INFO L226 Difference]: Without dead ends: 188 [2019-09-07 10:14:42,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:14:42,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-07 10:14:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2019-09-07 10:14:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-07 10:14:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 214 transitions. [2019-09-07 10:14:42,191 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 214 transitions. Word has length 177 [2019-09-07 10:14:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:42,192 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 214 transitions. [2019-09-07 10:14:42,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 10:14:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2019-09-07 10:14:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-07 10:14:42,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:42,193 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:42,193 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash 822088625, now seen corresponding path program 19 times [2019-09-07 10:14:42,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:42,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:42,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:42,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:42,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1873 backedges. 8 proven. 729 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2019-09-07 10:14:42,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:42,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:42,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:42,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:14:42,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1873 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2019-09-07 10:14:42,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:42,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:14:42,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:14:42,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:14:42,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:14:42,779 INFO L87 Difference]: Start difference. First operand 185 states and 214 transitions. Second operand 31 states. [2019-09-07 10:14:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:42,880 INFO L93 Difference]: Finished difference Result 312 states and 370 transitions. [2019-09-07 10:14:42,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:14:42,880 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 182 [2019-09-07 10:14:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:42,883 INFO L225 Difference]: With dead ends: 312 [2019-09-07 10:14:42,883 INFO L226 Difference]: Without dead ends: 188 [2019-09-07 10:14:42,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 182 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-09-07 10:14:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-07 10:14:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-07 10:14:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-07 10:14:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 216 transitions. [2019-09-07 10:14:42,899 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 216 transitions. Word has length 182 [2019-09-07 10:14:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:42,900 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 216 transitions. [2019-09-07 10:14:42,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:14:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 216 transitions. [2019-09-07 10:14:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-07 10:14:42,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:42,901 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:42,902 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2004512429, now seen corresponding path program 20 times [2019-09-07 10:14:42,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:42,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:42,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:42,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:42,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1928 backedges. 8 proven. 1080 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-07 10:14:43,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:43,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:43,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:14:43,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:43,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:43,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:14:43,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1928 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:44,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:44,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2019-09-07 10:14:44,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 10:14:44,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 10:14:44,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:14:44,316 INFO L87 Difference]: Start difference. First operand 187 states and 216 transitions. Second operand 59 states. [2019-09-07 10:14:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:44,604 INFO L93 Difference]: Finished difference Result 319 states and 380 transitions. [2019-09-07 10:14:44,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 10:14:44,604 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 184 [2019-09-07 10:14:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:44,605 INFO L225 Difference]: With dead ends: 319 [2019-09-07 10:14:44,605 INFO L226 Difference]: Without dead ends: 195 [2019-09-07 10:14:44,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:14:44,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-07 10:14:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-09-07 10:14:44,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-07 10:14:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2019-09-07 10:14:44,619 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 184 [2019-09-07 10:14:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:44,620 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2019-09-07 10:14:44,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 10:14:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2019-09-07 10:14:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-07 10:14:44,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:44,621 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:44,621 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:44,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1429872943, now seen corresponding path program 21 times [2019-09-07 10:14:44,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:44,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:44,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:44,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:44,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2067 backedges. 8 proven. 1162 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2019-09-07 10:14:45,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:45,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:45,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:14:45,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 10:14:45,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:45,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:14:45,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:45,769 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-09-07 10:14:45,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:14:45,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:14:45,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:14:45,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:14:45,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:14:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2067 backedges. 16 proven. 390 refuted. 0 times theorem prover too weak. 1661 trivial. 0 not checked. [2019-09-07 10:14:45,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:45,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 20] total 49 [2019-09-07 10:14:45,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:14:45,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:14:45,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=1698, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:14:45,903 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 49 states. [2019-09-07 10:14:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:48,418 INFO L93 Difference]: Finished difference Result 340 states and 405 transitions. [2019-09-07 10:14:48,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 10:14:48,419 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 189 [2019-09-07 10:14:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:48,421 INFO L225 Difference]: With dead ends: 340 [2019-09-07 10:14:48,421 INFO L226 Difference]: Without dead ends: 299 [2019-09-07 10:14:48,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2985 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2587, Invalid=8969, Unknown=0, NotChecked=0, Total=11556 [2019-09-07 10:14:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-07 10:14:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 289. [2019-09-07 10:14:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-07 10:14:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 348 transitions. [2019-09-07 10:14:48,444 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 348 transitions. Word has length 189 [2019-09-07 10:14:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:48,445 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 348 transitions. [2019-09-07 10:14:48,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:14:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 348 transitions. [2019-09-07 10:14:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 10:14:48,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:48,447 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:48,447 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash 240723507, now seen corresponding path program 10 times [2019-09-07 10:14:48,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:48,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:48,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:48,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:48,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 8 proven. 841 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-09-07 10:14:48,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:48,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:48,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:14:48,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:48,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:48,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:14:48,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-09-07 10:14:49,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:49,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 10:14:49,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:14:49,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:14:49,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:14:49,018 INFO L87 Difference]: Start difference. First operand 289 states and 348 transitions. Second operand 33 states. [2019-09-07 10:14:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:49,134 INFO L93 Difference]: Finished difference Result 516 states and 634 transitions. [2019-09-07 10:14:49,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:14:49,135 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 192 [2019-09-07 10:14:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:49,136 INFO L225 Difference]: With dead ends: 516 [2019-09-07 10:14:49,136 INFO L226 Difference]: Without dead ends: 292 [2019-09-07 10:14:49,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:14:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-07 10:14:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-09-07 10:14:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-07 10:14:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 350 transitions. [2019-09-07 10:14:49,157 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 350 transitions. Word has length 192 [2019-09-07 10:14:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:49,158 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 350 transitions. [2019-09-07 10:14:49,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:14:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 350 transitions. [2019-09-07 10:14:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-07 10:14:49,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:49,160 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 28, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:49,160 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:49,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1738506581, now seen corresponding path program 11 times [2019-09-07 10:14:49,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:49,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:49,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 8 proven. 1247 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2019-09-07 10:14:49,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:49,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:14:49,758 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:54,670 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-07 10:14:54,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:54,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:14:54,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-09-07 10:14:55,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:55,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 63 [2019-09-07 10:14:55,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 10:14:55,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 10:14:55,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:14:55,620 INFO L87 Difference]: Start difference. First operand 291 states and 350 transitions. Second operand 63 states. [2019-09-07 10:14:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:55,971 INFO L93 Difference]: Finished difference Result 528 states and 652 transitions. [2019-09-07 10:14:55,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 10:14:55,972 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 194 [2019-09-07 10:14:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:55,973 INFO L225 Difference]: With dead ends: 528 [2019-09-07 10:14:55,974 INFO L226 Difference]: Without dead ends: 304 [2019-09-07 10:14:55,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:14:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-07 10:14:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2019-09-07 10:14:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-07 10:14:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 360 transitions. [2019-09-07 10:14:55,997 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 360 transitions. Word has length 194 [2019-09-07 10:14:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:55,997 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 360 transitions. [2019-09-07 10:14:55,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 10:14:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 360 transitions. [2019-09-07 10:14:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-07 10:14:55,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:56,000 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 29, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:56,000 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1558260009, now seen corresponding path program 12 times [2019-09-07 10:14:56,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:56,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:56,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:56,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2360 backedges. 8 proven. 1335 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2019-09-07 10:14:56,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:56,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:56,574 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:14:59,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-09-07 10:14:59,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:59,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:14:59,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:00,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:15:00,454 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 32 treesize of output 22 [2019-09-07 10:15:00,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:15:00,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:15:00,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:15:00,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:15:00,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 10:15:00,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:15:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2360 backedges. 83 proven. 425 refuted. 0 times theorem prover too weak. 1852 trivial. 0 not checked. [2019-09-07 10:15:00,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:00,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 23] total 54 [2019-09-07 10:15:00,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 10:15:00,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 10:15:00,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=749, Invalid=2113, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:15:00,627 INFO L87 Difference]: Start difference. First operand 299 states and 360 transitions. Second operand 54 states. [2019-09-07 10:15:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:07,145 INFO L93 Difference]: Finished difference Result 409 states and 477 transitions. [2019-09-07 10:15:07,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-07 10:15:07,145 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 199 [2019-09-07 10:15:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:07,147 INFO L225 Difference]: With dead ends: 409 [2019-09-07 10:15:07,148 INFO L226 Difference]: Without dead ends: 345 [2019-09-07 10:15:07,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 172 SyntacticMatches, 7 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9577 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5793, Invalid=20939, Unknown=0, NotChecked=0, Total=26732 [2019-09-07 10:15:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-09-07 10:15:07,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-09-07 10:15:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-07 10:15:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 246 transitions. [2019-09-07 10:15:07,166 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 246 transitions. Word has length 199 [2019-09-07 10:15:07,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:07,167 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 246 transitions. [2019-09-07 10:15:07,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 10:15:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 246 transitions. [2019-09-07 10:15:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-07 10:15:07,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:07,169 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:07,169 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:07,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:07,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1325357040, now seen corresponding path program 22 times [2019-09-07 10:15:07,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:07,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:07,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:07,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:07,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2487 backedges. 10 proven. 961 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked. [2019-09-07 10:15:07,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:07,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:07,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:15:07,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:15:07,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:07,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:15:07,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2487 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2019-09-07 10:15:07,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:07,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:15:07,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:15:07,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:15:07,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:15:07,818 INFO L87 Difference]: Start difference. First operand 213 states and 246 transitions. Second operand 35 states. [2019-09-07 10:15:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:07,935 INFO L93 Difference]: Finished difference Result 360 states and 426 transitions. [2019-09-07 10:15:07,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:15:07,936 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 210 [2019-09-07 10:15:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:07,937 INFO L225 Difference]: With dead ends: 360 [2019-09-07 10:15:07,937 INFO L226 Difference]: Without dead ends: 216 [2019-09-07 10:15:07,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:15:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-07 10:15:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-09-07 10:15:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-07 10:15:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2019-09-07 10:15:07,954 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 210 [2019-09-07 10:15:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:07,954 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2019-09-07 10:15:07,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:15:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2019-09-07 10:15:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-07 10:15:07,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:07,956 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:07,957 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:07,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:07,957 INFO L82 PathProgramCache]: Analyzing trace with hash 69594770, now seen corresponding path program 23 times [2019-09-07 10:15:07,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:07,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:07,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:07,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:07,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 10 proven. 1426 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2019-09-07 10:15:08,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:08,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:15:08,600 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:15,071 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-09-07 10:15:15,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:15,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:15:15,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2019-09-07 10:15:15,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:15,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:15:15,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:15:15,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:15:15,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:15:15,141 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand 35 states. [2019-09-07 10:15:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:15,327 INFO L93 Difference]: Finished difference Result 269 states and 305 transitions. [2019-09-07 10:15:15,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:15:15,327 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 212 [2019-09-07 10:15:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:15,329 INFO L225 Difference]: With dead ends: 269 [2019-09-07 10:15:15,329 INFO L226 Difference]: Without dead ends: 220 [2019-09-07 10:15:15,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:15:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-07 10:15:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2019-09-07 10:15:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-07 10:15:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 252 transitions. [2019-09-07 10:15:15,347 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 252 transitions. Word has length 212 [2019-09-07 10:15:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:15,347 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 252 transitions. [2019-09-07 10:15:15,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:15:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 252 transitions. [2019-09-07 10:15:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-07 10:15:15,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:15,351 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:15,351 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:15,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:15,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1705495616, now seen corresponding path program 24 times [2019-09-07 10:15:15,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:15,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:15,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2644 backedges. 10 proven. 1024 refuted. 0 times theorem prover too weak. 1610 trivial. 0 not checked. [2019-09-07 10:15:16,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:16,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:16,042 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:15:21,623 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-09-07 10:15:21,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:21,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:15:21,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2644 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2019-09-07 10:15:21,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:21,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 10:15:21,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:15:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:15:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:15:21,680 INFO L87 Difference]: Start difference. First operand 218 states and 252 transitions. Second operand 36 states. [2019-09-07 10:15:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:21,810 INFO L93 Difference]: Finished difference Result 368 states and 436 transitions. [2019-09-07 10:15:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:15:21,810 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 215 [2019-09-07 10:15:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:21,812 INFO L225 Difference]: With dead ends: 368 [2019-09-07 10:15:21,812 INFO L226 Difference]: Without dead ends: 221 [2019-09-07 10:15:21,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:15:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-07 10:15:21,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-09-07 10:15:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-07 10:15:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 254 transitions. [2019-09-07 10:15:21,832 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 254 transitions. Word has length 215 [2019-09-07 10:15:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:21,832 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 254 transitions. [2019-09-07 10:15:21,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:15:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2019-09-07 10:15:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-07 10:15:21,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:21,834 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:21,834 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash 944796254, now seen corresponding path program 25 times [2019-09-07 10:15:21,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:21,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:21,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:21,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:21,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 10 proven. 1520 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-09-07 10:15:22,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:22,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:22,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:15:22,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2019-09-07 10:15:23,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:23,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 69 [2019-09-07 10:15:23,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 10:15:23,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 10:15:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:15:23,405 INFO L87 Difference]: Start difference. First operand 220 states and 254 transitions. Second operand 69 states. [2019-09-07 10:15:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:23,806 INFO L93 Difference]: Finished difference Result 375 states and 446 transitions. [2019-09-07 10:15:23,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 10:15:23,807 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 217 [2019-09-07 10:15:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:23,808 INFO L225 Difference]: With dead ends: 375 [2019-09-07 10:15:23,808 INFO L226 Difference]: Without dead ends: 228 [2019-09-07 10:15:23,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:15:23,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-07 10:15:23,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2019-09-07 10:15:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-07 10:15:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 260 transitions. [2019-09-07 10:15:23,822 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 260 transitions. Word has length 217 [2019-09-07 10:15:23,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:23,822 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 260 transitions. [2019-09-07 10:15:23,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 10:15:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 260 transitions. [2019-09-07 10:15:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 10:15:23,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:23,824 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:23,825 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:23,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1895022742, now seen corresponding path program 26 times [2019-09-07 10:15:23,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:23,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:23,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:23,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:23,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 10 proven. 1617 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2019-09-07 10:15:24,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:24,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:15:24,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:24,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:15:24,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:24,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:15:24,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2019-09-07 10:15:25,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:25,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 71 [2019-09-07 10:15:25,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-07 10:15:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-07 10:15:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:15:25,415 INFO L87 Difference]: Start difference. First operand 225 states and 260 transitions. Second operand 71 states. [2019-09-07 10:15:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:25,834 INFO L93 Difference]: Finished difference Result 383 states and 456 transitions. [2019-09-07 10:15:25,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 10:15:25,835 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 222 [2019-09-07 10:15:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:25,836 INFO L225 Difference]: With dead ends: 383 [2019-09-07 10:15:25,836 INFO L226 Difference]: Without dead ends: 233 [2019-09-07 10:15:25,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:15:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-07 10:15:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2019-09-07 10:15:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-07 10:15:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 266 transitions. [2019-09-07 10:15:25,852 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 266 transitions. Word has length 222 [2019-09-07 10:15:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:25,852 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 266 transitions. [2019-09-07 10:15:25,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-07 10:15:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 266 transitions. [2019-09-07 10:15:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-07 10:15:25,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:25,854 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:25,854 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash 239862874, now seen corresponding path program 27 times [2019-09-07 10:15:25,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:25,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:25,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 10 proven. 1717 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2019-09-07 10:15:26,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:26,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:26,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:15:26,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-07 10:15:26,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:26,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:15:26,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:27,463 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-09-07 10:15:27,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:15:27,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:15:27,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:15:27,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:15:27,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:15:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 21 proven. 578 refuted. 0 times theorem prover too weak. 2443 trivial. 0 not checked. [2019-09-07 10:15:27,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:27,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 22] total 57 [2019-09-07 10:15:27,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 10:15:27,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 10:15:27,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=922, Invalid=2270, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:15:27,756 INFO L87 Difference]: Start difference. First operand 230 states and 266 transitions. Second operand 57 states. [2019-09-07 10:15:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:31,254 INFO L93 Difference]: Finished difference Result 405 states and 482 transitions. [2019-09-07 10:15:31,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-07 10:15:31,254 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 227 [2019-09-07 10:15:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:31,256 INFO L225 Difference]: With dead ends: 405 [2019-09-07 10:15:31,256 INFO L226 Difference]: Without dead ends: 356 [2019-09-07 10:15:31,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4155 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3642, Invalid=12360, Unknown=0, NotChecked=0, Total=16002 [2019-09-07 10:15:31,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-07 10:15:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 346. [2019-09-07 10:15:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-07 10:15:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 417 transitions. [2019-09-07 10:15:31,284 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 417 transitions. Word has length 227 [2019-09-07 10:15:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:31,285 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 417 transitions. [2019-09-07 10:15:31,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 10:15:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 417 transitions. [2019-09-07 10:15:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-07 10:15:31,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:31,287 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:31,287 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:31,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:31,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1589267210, now seen corresponding path program 13 times [2019-09-07 10:15:31,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:31,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:31,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:31,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:31,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3145 backedges. 10 proven. 1225 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-09-07 10:15:31,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:31,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:31,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:32,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:15:32,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3145 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2019-09-07 10:15:32,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:32,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-07 10:15:32,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:15:32,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:15:32,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:15:32,060 INFO L87 Difference]: Start difference. First operand 346 states and 417 transitions. Second operand 39 states. [2019-09-07 10:15:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:32,213 INFO L93 Difference]: Finished difference Result 618 states and 760 transitions. [2019-09-07 10:15:32,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 10:15:32,214 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 230 [2019-09-07 10:15:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:32,215 INFO L225 Difference]: With dead ends: 618 [2019-09-07 10:15:32,215 INFO L226 Difference]: Without dead ends: 349 [2019-09-07 10:15:32,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:15:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-07 10:15:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 348. [2019-09-07 10:15:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-07 10:15:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 419 transitions. [2019-09-07 10:15:32,242 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 419 transitions. Word has length 230 [2019-09-07 10:15:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:32,242 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 419 transitions. [2019-09-07 10:15:32,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:15:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 419 transitions. [2019-09-07 10:15:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-07 10:15:32,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:32,245 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 34, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:32,245 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash -535779688, now seen corresponding path program 14 times [2019-09-07 10:15:32,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:32,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:32,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3216 backedges. 10 proven. 1820 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2019-09-07 10:15:32,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:32,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:32,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:15:32,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:15:32,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:32,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 10:15:32,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3216 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2019-09-07 10:15:34,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 75 [2019-09-07 10:15:34,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-07 10:15:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-07 10:15:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 10:15:34,028 INFO L87 Difference]: Start difference. First operand 348 states and 419 transitions. Second operand 75 states. [2019-09-07 10:15:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:34,452 INFO L93 Difference]: Finished difference Result 630 states and 778 transitions. [2019-09-07 10:15:34,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 10:15:34,452 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 232 [2019-09-07 10:15:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:34,454 INFO L225 Difference]: With dead ends: 630 [2019-09-07 10:15:34,454 INFO L226 Difference]: Without dead ends: 361 [2019-09-07 10:15:34,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 10:15:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-09-07 10:15:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 356. [2019-09-07 10:15:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-07 10:15:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 429 transitions. [2019-09-07 10:15:34,482 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 429 transitions. Word has length 232 [2019-09-07 10:15:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:34,483 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 429 transitions. [2019-09-07 10:15:34,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-07 10:15:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 429 transitions. [2019-09-07 10:15:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-07 10:15:34,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:34,485 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 35, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:34,485 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:34,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:34,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1303905708, now seen corresponding path program 15 times [2019-09-07 10:15:34,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:34,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:34,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:34,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:34,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3395 backedges. 10 proven. 1926 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2019-09-07 10:15:35,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:35,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:35,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:15:35,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-07 10:15:35,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:35,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 10:15:35,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:36,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:15:36,738 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 32 treesize of output 22 [2019-09-07 10:15:36,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:15:36,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:15:36,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:15:36,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:15:36,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 10:15:36,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:15:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3395 backedges. 101 proven. 621 refuted. 0 times theorem prover too weak. 2673 trivial. 0 not checked. [2019-09-07 10:15:36,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:36,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 25] total 62 [2019-09-07 10:15:36,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 10:15:36,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 10:15:36,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1033, Invalid=2749, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 10:15:36,947 INFO L87 Difference]: Start difference. First operand 356 states and 429 transitions. Second operand 62 states. [2019-09-07 10:15:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:44,743 INFO L93 Difference]: Finished difference Result 482 states and 562 transitions. [2019-09-07 10:15:44,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-07 10:15:44,744 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 237 [2019-09-07 10:15:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:44,746 INFO L225 Difference]: With dead ends: 482 [2019-09-07 10:15:44,746 INFO L226 Difference]: Without dead ends: 406 [2019-09-07 10:15:44,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 206 SyntacticMatches, 9 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13435 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=8047, Invalid=28625, Unknown=0, NotChecked=0, Total=36672 [2019-09-07 10:15:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-07 10:15:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 251. [2019-09-07 10:15:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-07 10:15:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 290 transitions. [2019-09-07 10:15:44,769 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 290 transitions. Word has length 237 [2019-09-07 10:15:44,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:44,769 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 290 transitions. [2019-09-07 10:15:44,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 10:15:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 290 transitions. [2019-09-07 10:15:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-07 10:15:44,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:44,771 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:44,772 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:44,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:44,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1727268275, now seen corresponding path program 28 times [2019-09-07 10:15:44,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:44,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:44,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:44,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:44,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3548 backedges. 12 proven. 1369 refuted. 0 times theorem prover too weak. 2167 trivial. 0 not checked. [2019-09-07 10:15:46,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:46,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:46,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:15:46,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:15:46,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:46,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:15:46,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3548 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2019-09-07 10:15:46,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:46,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 10:15:46,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:15:46,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:15:46,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:15:46,394 INFO L87 Difference]: Start difference. First operand 251 states and 290 transitions. Second operand 41 states. [2019-09-07 10:15:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:46,555 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2019-09-07 10:15:46,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:15:46,556 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 248 [2019-09-07 10:15:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:46,557 INFO L225 Difference]: With dead ends: 424 [2019-09-07 10:15:46,557 INFO L226 Difference]: Without dead ends: 254 [2019-09-07 10:15:46,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:15:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-07 10:15:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-09-07 10:15:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-07 10:15:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 292 transitions. [2019-09-07 10:15:46,580 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 292 transitions. Word has length 248 [2019-09-07 10:15:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:46,580 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 292 transitions. [2019-09-07 10:15:46,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:15:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 292 transitions. [2019-09-07 10:15:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-07 10:15:46,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:46,582 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:46,582 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:46,583 INFO L82 PathProgramCache]: Analyzing trace with hash -753495339, now seen corresponding path program 29 times [2019-09-07 10:15:46,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:46,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:46,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:46,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:46,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3623 backedges. 12 proven. 2035 refuted. 0 times theorem prover too weak. 1576 trivial. 0 not checked. [2019-09-07 10:15:47,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:47,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:47,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:15:59,563 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2019-09-07 10:15:59,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:59,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:15:59,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3623 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2019-09-07 10:15:59,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:59,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 10:15:59,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:15:59,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:15:59,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:15:59,629 INFO L87 Difference]: Start difference. First operand 253 states and 292 transitions. Second operand 41 states. [2019-09-07 10:15:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:59,880 INFO L93 Difference]: Finished difference Result 315 states and 357 transitions. [2019-09-07 10:15:59,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:15:59,880 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 250 [2019-09-07 10:15:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:59,882 INFO L225 Difference]: With dead ends: 315 [2019-09-07 10:15:59,882 INFO L226 Difference]: Without dead ends: 258 [2019-09-07 10:15:59,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 250 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-09-07 10:15:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-07 10:15:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-07 10:15:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-07 10:15:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2019-09-07 10:15:59,902 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 250 [2019-09-07 10:15:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:59,903 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2019-09-07 10:15:59,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:15:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2019-09-07 10:15:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-07 10:15:59,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:59,905 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:59,905 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash 368999019, now seen corresponding path program 30 times [2019-09-07 10:15:59,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:59,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:59,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:59,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:59,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 12 proven. 1444 refuted. 0 times theorem prover too weak. 2279 trivial. 0 not checked. [2019-09-07 10:16:00,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:00,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:00,811 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:16:30,009 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2019-09-07 10:16:30,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:16:30,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:16:30,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2019-09-07 10:16:31,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:31,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 80 [2019-09-07 10:16:31,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-07 10:16:31,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-07 10:16:31,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 10:16:31,194 INFO L87 Difference]: Start difference. First operand 256 states and 296 transitions. Second operand 80 states. [2019-09-07 10:16:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:31,672 INFO L93 Difference]: Finished difference Result 437 states and 520 transitions. [2019-09-07 10:16:31,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-07 10:16:31,672 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 253 [2019-09-07 10:16:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:31,690 INFO L225 Difference]: With dead ends: 437 [2019-09-07 10:16:31,690 INFO L226 Difference]: Without dead ends: 264 [2019-09-07 10:16:31,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 10:16:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-07 10:16:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-09-07 10:16:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-07 10:16:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 302 transitions. [2019-09-07 10:16:31,703 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 302 transitions. Word has length 253 [2019-09-07 10:16:31,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:31,704 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 302 transitions. [2019-09-07 10:16:31,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-07 10:16:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 302 transitions. [2019-09-07 10:16:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-07 10:16:31,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:31,705 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:31,706 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:31,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:31,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1957056969, now seen corresponding path program 31 times [2019-09-07 10:16:31,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:31,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:31,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:31,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:16:31,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 12 proven. 1521 refuted. 0 times theorem prover too weak. 2394 trivial. 0 not checked. [2019-09-07 10:16:32,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:32,462 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:32,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:16:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:32,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 10:16:32,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 2406 trivial. 0 not checked. [2019-09-07 10:16:32,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:32,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-07 10:16:32,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:16:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:16:32,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:16:32,610 INFO L87 Difference]: Start difference. First operand 261 states and 302 transitions. Second operand 43 states. [2019-09-07 10:16:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:32,776 INFO L93 Difference]: Finished difference Result 440 states and 522 transitions. [2019-09-07 10:16:32,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 10:16:32,776 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 258 [2019-09-07 10:16:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:32,778 INFO L225 Difference]: With dead ends: 440 [2019-09-07 10:16:32,778 INFO L226 Difference]: Without dead ends: 264 [2019-09-07 10:16:32,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:16:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-07 10:16:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2019-09-07 10:16:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-07 10:16:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2019-09-07 10:16:32,797 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 258 [2019-09-07 10:16:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:32,798 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2019-09-07 10:16:32,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:16:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2019-09-07 10:16:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-07 10:16:32,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:32,800 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:32,800 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:32,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:32,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1909438681, now seen corresponding path program 32 times [2019-09-07 10:16:32,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:32,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:32,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:16:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4006 backedges. 12 proven. 2262 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2019-09-07 10:16:33,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:33,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:33,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:16:33,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:16:33,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:16:33,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 10:16:33,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4006 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 2406 trivial. 0 not checked. [2019-09-07 10:16:34,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:34,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43] total 83 [2019-09-07 10:16:34,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-07 10:16:34,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-07 10:16:34,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 10:16:34,878 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand 83 states. [2019-09-07 10:16:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:35,335 INFO L93 Difference]: Finished difference Result 447 states and 532 transitions. [2019-09-07 10:16:35,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-07 10:16:35,336 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 260 [2019-09-07 10:16:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:35,337 INFO L225 Difference]: With dead ends: 447 [2019-09-07 10:16:35,337 INFO L226 Difference]: Without dead ends: 271 [2019-09-07 10:16:35,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 10:16:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-07 10:16:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2019-09-07 10:16:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-07 10:16:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 310 transitions. [2019-09-07 10:16:35,372 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 310 transitions. Word has length 260 [2019-09-07 10:16:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:35,372 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 310 transitions. [2019-09-07 10:16:35,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-07 10:16:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 310 transitions. [2019-09-07 10:16:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-07 10:16:35,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:35,375 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:35,375 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1172393851, now seen corresponding path program 33 times [2019-09-07 10:16:35,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:35,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:35,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:35,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:16:35,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4205 backedges. 12 proven. 2380 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2019-09-07 10:16:36,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:36,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:36,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:16:37,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-07 10:16:37,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:16:37,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 10:16:37,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:37,822 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-09-07 10:16:37,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:16:37,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:16:37,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:16:37,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:16:37,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:16:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4205 backedges. 26 proven. 803 refuted. 0 times theorem prover too weak. 3376 trivial. 0 not checked. [2019-09-07 10:16:38,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:38,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 24] total 65 [2019-09-07 10:16:38,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-07 10:16:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-07 10:16:38,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1237, Invalid=2923, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 10:16:38,018 INFO L87 Difference]: Start difference. First operand 268 states and 310 transitions. Second operand 65 states. [2019-09-07 10:16:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:42,523 INFO L93 Difference]: Finished difference Result 470 states and 559 transitions. [2019-09-07 10:16:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-07 10:16:42,523 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 265 [2019-09-07 10:16:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:42,526 INFO L225 Difference]: With dead ends: 470 [2019-09-07 10:16:42,526 INFO L226 Difference]: Without dead ends: 413 [2019-09-07 10:16:42,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5516 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4879, Invalid=16291, Unknown=0, NotChecked=0, Total=21170 [2019-09-07 10:16:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-09-07 10:16:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 403. [2019-09-07 10:16:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-07 10:16:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 486 transitions. [2019-09-07 10:16:42,563 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 486 transitions. Word has length 265 [2019-09-07 10:16:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:42,563 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 486 transitions. [2019-09-07 10:16:42,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-07 10:16:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 486 transitions. [2019-09-07 10:16:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-07 10:16:42,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:42,565 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:42,566 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:42,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:42,566 INFO L82 PathProgramCache]: Analyzing trace with hash 877472953, now seen corresponding path program 16 times [2019-09-07 10:16:42,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:42,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:42,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:16:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4326 backedges. 12 proven. 1681 refuted. 0 times theorem prover too weak. 2633 trivial. 0 not checked. [2019-09-07 10:16:43,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:43,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:43,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:16:43,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:16:43,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:16:43,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 10:16:43,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4326 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2019-09-07 10:16:43,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:43,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-07 10:16:43,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 10:16:43,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 10:16:43,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:16:43,548 INFO L87 Difference]: Start difference. First operand 403 states and 486 transitions. Second operand 45 states. [2019-09-07 10:16:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:43,700 INFO L93 Difference]: Finished difference Result 720 states and 886 transitions. [2019-09-07 10:16:43,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:16:43,700 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 268 [2019-09-07 10:16:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:43,702 INFO L225 Difference]: With dead ends: 720 [2019-09-07 10:16:43,702 INFO L226 Difference]: Without dead ends: 406 [2019-09-07 10:16:43,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:16:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-07 10:16:43,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-09-07 10:16:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-07 10:16:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 488 transitions. [2019-09-07 10:16:43,727 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 488 transitions. Word has length 268 [2019-09-07 10:16:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:43,727 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 488 transitions. [2019-09-07 10:16:43,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 10:16:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 488 transitions. [2019-09-07 10:16:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-07 10:16:43,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:43,730 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 40, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:43,730 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:43,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:43,730 INFO L82 PathProgramCache]: Analyzing trace with hash 653776091, now seen corresponding path program 17 times [2019-09-07 10:16:43,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:43,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:43,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:16:43,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4409 backedges. 12 proven. 2501 refuted. 0 times theorem prover too weak. 1896 trivial. 0 not checked. [2019-09-07 10:16:44,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:44,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:44,618 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:17:00,396 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-07 10:17:00,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:00,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 10:17:00,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4409 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 1908 trivial. 0 not checked. [2019-09-07 10:17:00,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:00,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-07 10:17:00,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 10:17:00,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 10:17:00,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:17:00,490 INFO L87 Difference]: Start difference. First operand 405 states and 488 transitions. Second operand 45 states. [2019-09-07 10:17:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:00,660 INFO L93 Difference]: Finished difference Result 503 states and 598 transitions. [2019-09-07 10:17:00,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:17:00,660 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 270 [2019-09-07 10:17:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:00,662 INFO L225 Difference]: With dead ends: 503 [2019-09-07 10:17:00,662 INFO L226 Difference]: Without dead ends: 415 [2019-09-07 10:17:00,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:17:00,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-09-07 10:17:00,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2019-09-07 10:17:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-07 10:17:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 496 transitions. [2019-09-07 10:17:00,696 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 496 transitions. Word has length 270 [2019-09-07 10:17:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:00,696 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 496 transitions. [2019-09-07 10:17:00,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 10:17:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 496 transitions. [2019-09-07 10:17:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-07 10:17:00,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:00,698 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:17:00,698 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:00,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:00,698 INFO L82 PathProgramCache]: Analyzing trace with hash 157300577, now seen corresponding path program 18 times [2019-09-07 10:17:00,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:00,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:00,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:00,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:00,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4533 backedges. 12 proven. 1764 refuted. 0 times theorem prover too weak. 2757 trivial. 0 not checked. [2019-09-07 10:17:01,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:01,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:17:01,528 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:17:17,275 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2019-09-07 10:17:17,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:17,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 10:17:17,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:18,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:17:18,804 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 32 treesize of output 22 [2019-09-07 10:17:18,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:17:18,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:17:18,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:17:18,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:17:18,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 10:17:18,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:17:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4533 backedges. 119 proven. 854 refuted. 0 times theorem prover too weak. 3560 trivial. 0 not checked. [2019-09-07 10:17:19,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:19,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 27] total 70 [2019-09-07 10:17:19,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-07 10:17:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-07 10:17:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=3746, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 10:17:19,063 INFO L87 Difference]: Start difference. First operand 411 states and 496 transitions. Second operand 70 states. [2019-09-07 10:17:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:22,356 INFO L93 Difference]: Finished difference Result 778 states and 943 transitions. [2019-09-07 10:17:22,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-07 10:17:22,357 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 273 [2019-09-07 10:17:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:22,359 INFO L225 Difference]: With dead ends: 778 [2019-09-07 10:17:22,359 INFO L226 Difference]: Without dead ends: 458 [2019-09-07 10:17:22,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 238 SyntacticMatches, 11 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3513 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3106, Invalid=11174, Unknown=0, NotChecked=0, Total=14280 [2019-09-07 10:17:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-07 10:17:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 286. [2019-09-07 10:17:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-07 10:17:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 330 transitions. [2019-09-07 10:17:22,383 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 330 transitions. Word has length 273 [2019-09-07 10:17:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:22,383 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 330 transitions. [2019-09-07 10:17:22,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-07 10:17:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 330 transitions. [2019-09-07 10:17:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-07 10:17:22,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:22,386 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:17:22,387 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:22,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1479743048, now seen corresponding path program 34 times [2019-09-07 10:17:22,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:22,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:22,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:22,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:22,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4670 backedges. 14 proven. 2625 refuted. 0 times theorem prover too weak. 2031 trivial. 0 not checked. [2019-09-07 10:17:23,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:23,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:17:23,205 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:17:23,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:17:23,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:23,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:17:23,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4670 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2821 trivial. 0 not checked. [2019-09-07 10:17:24,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:24,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46] total 89 [2019-09-07 10:17:24,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-07 10:17:24,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-07 10:17:24,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2019-09-07 10:17:24,769 INFO L87 Difference]: Start difference. First operand 286 states and 330 transitions. Second operand 89 states. [2019-09-07 10:17:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:25,291 INFO L93 Difference]: Finished difference Result 487 states and 578 transitions. [2019-09-07 10:17:25,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-07 10:17:25,291 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 283 [2019-09-07 10:17:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:25,292 INFO L225 Difference]: With dead ends: 487 [2019-09-07 10:17:25,292 INFO L226 Difference]: Without dead ends: 294 [2019-09-07 10:17:25,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2019-09-07 10:17:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-07 10:17:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-09-07 10:17:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-07 10:17:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 336 transitions. [2019-09-07 10:17:25,309 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 336 transitions. Word has length 283 [2019-09-07 10:17:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:25,309 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 336 transitions. [2019-09-07 10:17:25,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-07 10:17:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 336 transitions. [2019-09-07 10:17:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-07 10:17:25,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:25,314 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:17:25,314 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:25,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:25,314 INFO L82 PathProgramCache]: Analyzing trace with hash 187727896, now seen corresponding path program 35 times [2019-09-07 10:17:25,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:25,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:25,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:25,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:25,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4884 backedges. 14 proven. 2752 refuted. 0 times theorem prover too weak. 2118 trivial. 0 not checked. [2019-09-07 10:17:26,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:26,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:17:26,144 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:17:41,086 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2019-09-07 10:17:41,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:41,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:17:41,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4884 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 2132 trivial. 0 not checked. [2019-09-07 10:17:41,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:41,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-07 10:17:41,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:17:41,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:17:41,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:17:41,192 INFO L87 Difference]: Start difference. First operand 291 states and 336 transitions. Second operand 47 states. [2019-09-07 10:17:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:41,446 INFO L93 Difference]: Finished difference Result 361 states and 409 transitions. [2019-09-07 10:17:41,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 10:17:41,446 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 288 [2019-09-07 10:17:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:41,448 INFO L225 Difference]: With dead ends: 361 [2019-09-07 10:17:41,448 INFO L226 Difference]: Without dead ends: 296 [2019-09-07 10:17:41,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:17:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-07 10:17:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-09-07 10:17:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-07 10:17:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 340 transitions. [2019-09-07 10:17:41,470 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 340 transitions. Word has length 288 [2019-09-07 10:17:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:41,470 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 340 transitions. [2019-09-07 10:17:41,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:17:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 340 transitions. [2019-09-07 10:17:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-07 10:17:41,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:41,473 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:17:41,473 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:41,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1873335786, now seen corresponding path program 36 times [2019-09-07 10:17:41,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:41,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:41,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:41,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5014 backedges. 14 proven. 1936 refuted. 0 times theorem prover too weak. 3064 trivial. 0 not checked. [2019-09-07 10:17:42,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:42,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:17:42,345 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:18:33,536 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2019-09-07 10:18:33,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:18:33,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 10:18:33,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5014 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 2132 trivial. 0 not checked. [2019-09-07 10:18:35,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:35,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 92 [2019-09-07 10:18:35,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-07 10:18:35,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-07 10:18:35,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2019-09-07 10:18:35,281 INFO L87 Difference]: Start difference. First operand 294 states and 340 transitions. Second operand 92 states. [2019-09-07 10:18:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:18:35,720 INFO L93 Difference]: Finished difference Result 501 states and 596 transitions. [2019-09-07 10:18:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-07 10:18:35,721 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 291 [2019-09-07 10:18:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:18:35,722 INFO L225 Difference]: With dead ends: 501 [2019-09-07 10:18:35,722 INFO L226 Difference]: Without dead ends: 302 [2019-09-07 10:18:35,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2019-09-07 10:18:35,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-07 10:18:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2019-09-07 10:18:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-07 10:18:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 346 transitions. [2019-09-07 10:18:35,739 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 346 transitions. Word has length 291 [2019-09-07 10:18:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:18:35,739 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 346 transitions. [2019-09-07 10:18:35,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-07 10:18:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 346 transitions. [2019-09-07 10:18:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-07 10:18:35,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:18:35,741 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:18:35,741 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:18:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:18:35,741 INFO L82 PathProgramCache]: Analyzing trace with hash -526108422, now seen corresponding path program 37 times [2019-09-07 10:18:35,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:18:35,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:18:35,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:35,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:18:35,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5236 backedges. 14 proven. 2025 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2019-09-07 10:18:36,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:18:36,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:18:36,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:18:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:36,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:18:36,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5236 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 3211 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (68)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:18:36,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:36,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-07 10:18:36,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:18:36,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:18:36,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:18:36,953 INFO L87 Difference]: Start difference. First operand 299 states and 346 transitions. Second operand 49 states. [2019-09-07 10:18:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:18:37,116 INFO L93 Difference]: Finished difference Result 504 states and 598 transitions. [2019-09-07 10:18:37,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 10:18:37,116 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 296 [2019-09-07 10:18:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:18:37,118 INFO L225 Difference]: With dead ends: 504 [2019-09-07 10:18:37,118 INFO L226 Difference]: Without dead ends: 302 [2019-09-07 10:18:37,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:18:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-07 10:18:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-09-07 10:18:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-07 10:18:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 348 transitions. [2019-09-07 10:18:37,133 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 348 transitions. Word has length 296 [2019-09-07 10:18:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:18:37,134 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 348 transitions. [2019-09-07 10:18:37,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:18:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 348 transitions. [2019-09-07 10:18:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-07 10:18:37,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:18:37,135 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:18:37,136 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:18:37,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:18:37,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2061449756, now seen corresponding path program 38 times [2019-09-07 10:18:37,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:18:37,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:18:37,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:37,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:18:37,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5327 backedges. 14 proven. 3015 refuted. 0 times theorem prover too weak. 2298 trivial. 0 not checked. [2019-09-07 10:18:38,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:18:38,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:18:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:18:38,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:18:38,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:18:38,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 10:18:38,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5327 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3211 trivial. 0 not checked. [2019-09-07 10:18:39,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:39,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 49] total 95 [2019-09-07 10:18:39,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-07 10:18:39,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-07 10:18:39,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2019-09-07 10:18:39,837 INFO L87 Difference]: Start difference. First operand 301 states and 348 transitions. Second operand 95 states. [2019-09-07 10:18:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:18:40,329 INFO L93 Difference]: Finished difference Result 511 states and 608 transitions. [2019-09-07 10:18:40,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-07 10:18:40,329 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 298 [2019-09-07 10:18:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:18:40,331 INFO L225 Difference]: With dead ends: 511 [2019-09-07 10:18:40,331 INFO L226 Difference]: Without dead ends: 309 [2019-09-07 10:18:40,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2019-09-07 10:18:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-07 10:18:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-09-07 10:18:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-07 10:18:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 354 transitions. [2019-09-07 10:18:40,369 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 354 transitions. Word has length 298 [2019-09-07 10:18:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:18:40,369 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 354 transitions. [2019-09-07 10:18:40,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-07 10:18:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 354 transitions. [2019-09-07 10:18:40,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-07 10:18:40,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:18:40,373 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:18:40,373 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:18:40,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:18:40,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1342544464, now seen corresponding path program 39 times [2019-09-07 10:18:40,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:18:40,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:18:40,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:40,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:18:40,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 14 proven. 3151 refuted. 0 times theorem prover too weak. 2391 trivial. 0 not checked. [2019-09-07 10:18:41,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:18:41,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:18:41,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:18:42,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-07 10:18:42,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:18:42,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:18:42,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:43,313 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-09-07 10:18:43,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:18:43,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:18:43,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:18:43,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:18:43,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:18:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 31 proven. 1065 refuted. 0 times theorem prover too weak. 4460 trivial. 0 not checked. [2019-09-07 10:18:43,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:43,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 26] total 73 [2019-09-07 10:18:43,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-07 10:18:43,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-07 10:18:43,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=3657, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 10:18:43,564 INFO L87 Difference]: Start difference. First operand 306 states and 354 transitions. Second operand 73 states. [2019-09-07 10:18:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:18:48,577 INFO L93 Difference]: Finished difference Result 535 states and 636 transitions. [2019-09-07 10:18:48,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-07 10:18:48,578 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 303 [2019-09-07 10:18:48,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:18:48,581 INFO L225 Difference]: With dead ends: 535 [2019-09-07 10:18:48,582 INFO L226 Difference]: Without dead ends: 470 [2019-09-07 10:18:48,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7068 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6298, Invalid=20762, Unknown=0, NotChecked=0, Total=27060 [2019-09-07 10:18:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-07 10:18:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 460. [2019-09-07 10:18:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-07 10:18:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 555 transitions. [2019-09-07 10:18:48,621 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 555 transitions. Word has length 303 [2019-09-07 10:18:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:18:48,621 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 555 transitions. [2019-09-07 10:18:48,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-07 10:18:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 555 transitions. [2019-09-07 10:18:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-07 10:18:48,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:18:48,624 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:18:48,624 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:18:48,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:18:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1748152964, now seen corresponding path program 19 times [2019-09-07 10:18:48,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:18:48,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:18:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:48,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:18:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5695 backedges. 14 proven. 2209 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2019-09-07 10:18:49,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:18:49,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:18:49,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:18:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:49,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 10:18:49,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5695 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-09-07 10:18:49,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:49,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-07 10:18:49,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:18:49,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:18:49,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:18:49,779 INFO L87 Difference]: Start difference. First operand 460 states and 555 transitions. Second operand 51 states. [2019-09-07 10:18:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:18:49,967 INFO L93 Difference]: Finished difference Result 822 states and 1012 transitions. [2019-09-07 10:18:49,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 10:18:49,967 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 306 [2019-09-07 10:18:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:18:49,969 INFO L225 Difference]: With dead ends: 822 [2019-09-07 10:18:49,969 INFO L226 Difference]: Without dead ends: 463 [2019-09-07 10:18:49,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:18:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-07 10:18:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 462. [2019-09-07 10:18:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-09-07 10:18:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 557 transitions. [2019-09-07 10:18:49,999 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 557 transitions. Word has length 306 [2019-09-07 10:18:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:18:49,999 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 557 transitions. [2019-09-07 10:18:50,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:18:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 557 transitions. [2019-09-07 10:18:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-07 10:18:50,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:18:50,001 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 46, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:18:50,001 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:18:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:18:50,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1889874914, now seen corresponding path program 20 times [2019-09-07 10:18:50,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:18:50,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:18:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:50,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:18:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5790 backedges. 14 proven. 3290 refuted. 0 times theorem prover too weak. 2486 trivial. 0 not checked. [2019-09-07 10:18:50,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:18:50,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:18:50,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:18:51,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:18:51,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:18:51,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:18:51,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5790 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-09-07 10:18:52,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:52,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 51] total 99 [2019-09-07 10:18:52,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-07 10:18:52,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-07 10:18:52,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2019-09-07 10:18:52,919 INFO L87 Difference]: Start difference. First operand 462 states and 557 transitions. Second operand 99 states. [2019-09-07 10:18:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:18:53,419 INFO L93 Difference]: Finished difference Result 834 states and 1030 transitions. [2019-09-07 10:18:53,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-07 10:18:53,419 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 308 [2019-09-07 10:18:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:18:53,421 INFO L225 Difference]: With dead ends: 834 [2019-09-07 10:18:53,421 INFO L226 Difference]: Without dead ends: 475 [2019-09-07 10:18:53,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2019-09-07 10:18:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-07 10:18:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 470. [2019-09-07 10:18:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-07 10:18:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 567 transitions. [2019-09-07 10:18:53,455 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 567 transitions. Word has length 308 [2019-09-07 10:18:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:18:53,455 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 567 transitions. [2019-09-07 10:18:53,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-07 10:18:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 567 transitions. [2019-09-07 10:18:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-07 10:18:53,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:18:53,457 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 47, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:18:53,457 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:18:53,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:18:53,457 INFO L82 PathProgramCache]: Analyzing trace with hash 863729578, now seen corresponding path program 21 times [2019-09-07 10:18:53,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:18:53,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:18:53,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:53,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:18:53,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6029 backedges. 14 proven. 3432 refuted. 0 times theorem prover too weak. 2583 trivial. 0 not checked. [2019-09-07 10:18:54,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:18:54,528 INFO L223 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-09-07 10:18:54,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:18:56,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-07 10:18:56,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:18:56,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 10:18:56,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:58,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:18:58,117 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 32 treesize of output 22 [2019-09-07 10:18:58,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:18:58,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:18:58,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:18:58,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:18:58,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 10:18:58,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:18:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6029 backedges. 137 proven. 1124 refuted. 0 times theorem prover too weak. 4768 trivial. 0 not checked. [2019-09-07 10:18:58,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:58,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 29] total 78 [2019-09-07 10:18:58,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-07 10:18:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-07 10:18:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1742, Invalid=4264, Unknown=0, NotChecked=0, Total=6006 [2019-09-07 10:18:58,445 INFO L87 Difference]: Start difference. First operand 470 states and 567 transitions. Second operand 78 states. [2019-09-07 10:19:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:10,673 INFO L93 Difference]: Finished difference Result 628 states and 732 transitions. [2019-09-07 10:19:10,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2019-09-07 10:19:10,673 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 313 [2019-09-07 10:19:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:10,676 INFO L225 Difference]: With dead ends: 628 [2019-09-07 10:19:10,676 INFO L226 Difference]: Without dead ends: 528 [2019-09-07 10:19:10,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 274 SyntacticMatches, 13 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23110 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=13671, Invalid=47585, Unknown=0, NotChecked=0, Total=61256 [2019-09-07 10:19:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-07 10:19:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 327. [2019-09-07 10:19:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-07 10:19:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 378 transitions. [2019-09-07 10:19:10,703 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 378 transitions. Word has length 313 [2019-09-07 10:19:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:10,703 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 378 transitions. [2019-09-07 10:19:10,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-07 10:19:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 378 transitions. [2019-09-07 10:19:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-07 10:19:10,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:10,705 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:10,705 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash -121791431, now seen corresponding path program 40 times [2019-09-07 10:19:10,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:10,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:10,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:10,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:10,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6234 backedges. 16 proven. 2401 refuted. 0 times theorem prover too weak. 3817 trivial. 0 not checked. [2019-09-07 10:19:11,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:11,762 INFO L223 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-09-07 10:19:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:19:11,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:19:11,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:11,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 10:19:11,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6234 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 3833 trivial. 0 not checked. [2019-09-07 10:19:11,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:11,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-07 10:19:11,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 10:19:11,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 10:19:11,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:19:11,953 INFO L87 Difference]: Start difference. First operand 327 states and 378 transitions. Second operand 53 states. [2019-09-07 10:19:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:12,124 INFO L93 Difference]: Finished difference Result 552 states and 654 transitions. [2019-09-07 10:19:12,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:19:12,124 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 324 [2019-09-07 10:19:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:12,126 INFO L225 Difference]: With dead ends: 552 [2019-09-07 10:19:12,126 INFO L226 Difference]: Without dead ends: 330 [2019-09-07 10:19:12,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:19:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-07 10:19:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-09-07 10:19:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-07 10:19:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 380 transitions. [2019-09-07 10:19:12,144 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 380 transitions. Word has length 324 [2019-09-07 10:19:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:12,144 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 380 transitions. [2019-09-07 10:19:12,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 10:19:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 380 transitions. [2019-09-07 10:19:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-07 10:19:12,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:12,146 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:12,146 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:12,146 INFO L82 PathProgramCache]: Analyzing trace with hash 150566491, now seen corresponding path program 41 times [2019-09-07 10:19:12,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:12,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:12,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:12,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:12,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6333 backedges. 16 proven. 3577 refuted. 0 times theorem prover too weak. 2740 trivial. 0 not checked. [2019-09-07 10:19:13,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:13,234 INFO L223 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-09-07 10:19:13,245 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:19:29,018 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2019-09-07 10:19:29,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:29,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 10:19:29,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6333 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 3833 trivial. 0 not checked. [2019-09-07 10:19:30,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:30,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 53] total 103 [2019-09-07 10:19:30,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-07 10:19:30,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-07 10:19:30,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2019-09-07 10:19:30,955 INFO L87 Difference]: Start difference. First operand 329 states and 380 transitions. Second operand 103 states. [2019-09-07 10:19:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:31,553 INFO L93 Difference]: Finished difference Result 559 states and 664 transitions. [2019-09-07 10:19:31,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-07 10:19:31,553 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 326 [2019-09-07 10:19:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:31,554 INFO L225 Difference]: With dead ends: 559 [2019-09-07 10:19:31,554 INFO L226 Difference]: Without dead ends: 337 [2019-09-07 10:19:31,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2499 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2019-09-07 10:19:31,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-07 10:19:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 334. [2019-09-07 10:19:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-07 10:19:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 386 transitions. [2019-09-07 10:19:31,573 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 386 transitions. Word has length 326 [2019-09-07 10:19:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:31,573 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 386 transitions. [2019-09-07 10:19:31,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-07 10:19:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 386 transitions. [2019-09-07 10:19:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-07 10:19:31,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:31,575 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:31,575 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:31,575 INFO L82 PathProgramCache]: Analyzing trace with hash -256660001, now seen corresponding path program 42 times [2019-09-07 10:19:31,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:31,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:31,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:31,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:31,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 16 proven. 3725 refuted. 0 times theorem prover too weak. 2841 trivial. 0 not checked. [2019-09-07 10:19:32,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:32,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-07 10:19:32,624 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:20:17,924 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2019-09-07 10:20:17,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:20:17,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 10:20:17,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 2857 trivial. 0 not checked. [2019-09-07 10:20:18,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:18,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-07 10:20:18,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 10:20:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 10:20:18,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:20:18,015 INFO L87 Difference]: Start difference. First operand 334 states and 386 transitions. Second operand 54 states. [2019-09-07 10:20:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:18,321 INFO L93 Difference]: Finished difference Result 412 states and 467 transitions. [2019-09-07 10:20:18,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 10:20:18,321 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 331 [2019-09-07 10:20:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:18,323 INFO L225 Difference]: With dead ends: 412 [2019-09-07 10:20:18,323 INFO L226 Difference]: Without dead ends: 339 [2019-09-07 10:20:18,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:20:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-07 10:20:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2019-09-07 10:20:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-07 10:20:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 390 transitions. [2019-09-07 10:20:18,341 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 390 transitions. Word has length 331 [2019-09-07 10:20:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:18,342 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 390 transitions. [2019-09-07 10:20:18,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 10:20:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 390 transitions. [2019-09-07 10:20:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-07 10:20:18,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:18,343 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:18,343 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash 953478333, now seen corresponding path program 43 times [2019-09-07 10:20:18,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:18,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:18,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:18,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:20:18,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6733 backedges. 16 proven. 2601 refuted. 0 times theorem prover too weak. 4116 trivial. 0 not checked. [2019-09-07 10:20:19,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:19,430 INFO L223 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-09-07 10:20:19,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:20:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:19,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 10:20:19,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6733 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2019-09-07 10:20:19,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:19,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-07 10:20:19,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 10:20:19,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 10:20:19,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:20:19,641 INFO L87 Difference]: Start difference. First operand 337 states and 390 transitions. Second operand 55 states. [2019-09-07 10:20:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:19,860 INFO L93 Difference]: Finished difference Result 568 states and 674 transitions. [2019-09-07 10:20:19,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 10:20:19,860 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 334 [2019-09-07 10:20:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:19,862 INFO L225 Difference]: With dead ends: 568 [2019-09-07 10:20:19,862 INFO L226 Difference]: Without dead ends: 340 [2019-09-07 10:20:19,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:20:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-09-07 10:20:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2019-09-07 10:20:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-07 10:20:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 392 transitions. [2019-09-07 10:20:19,880 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 392 transitions. Word has length 334 [2019-09-07 10:20:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:19,881 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 392 transitions. [2019-09-07 10:20:19,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 10:20:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 392 transitions. [2019-09-07 10:20:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-07 10:20:19,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:19,882 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:19,882 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:19,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:19,883 INFO L82 PathProgramCache]: Analyzing trace with hash 31982687, now seen corresponding path program 44 times [2019-09-07 10:20:19,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:19,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:19,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:20:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6836 backedges. 16 proven. 3876 refuted. 0 times theorem prover too weak. 2944 trivial. 0 not checked. [2019-09-07 10:20:21,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:21,474 INFO L223 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-09-07 10:20:21,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:20:21,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:20:21,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:20:21,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:20:21,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6836 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2019-09-07 10:20:23,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:23,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 55] total 107 [2019-09-07 10:20:23,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-07 10:20:23,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-07 10:20:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-09-07 10:20:23,678 INFO L87 Difference]: Start difference. First operand 339 states and 392 transitions. Second operand 107 states. [2019-09-07 10:20:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:24,333 INFO L93 Difference]: Finished difference Result 575 states and 684 transitions. [2019-09-07 10:20:24,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-07 10:20:24,333 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 336 [2019-09-07 10:20:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:24,335 INFO L225 Difference]: With dead ends: 575 [2019-09-07 10:20:24,335 INFO L226 Difference]: Without dead ends: 347 [2019-09-07 10:20:24,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-09-07 10:20:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-07 10:20:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2019-09-07 10:20:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-07 10:20:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 398 transitions. [2019-09-07 10:20:24,354 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 398 transitions. Word has length 336 [2019-09-07 10:20:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:24,354 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 398 transitions. [2019-09-07 10:20:24,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-07 10:20:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 398 transitions. [2019-09-07 10:20:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-07 10:20:24,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:24,356 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:24,356 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:24,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1859689509, now seen corresponding path program 45 times [2019-09-07 10:20:24,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:24,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:24,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:20:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7095 backedges. 16 proven. 4030 refuted. 0 times theorem prover too weak. 3049 trivial. 0 not checked. [2019-09-07 10:20:25,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:25,476 INFO L223 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-09-07 10:20:25,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:20:28,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-07 10:20:28,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:20:28,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:20:28,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:29,384 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-09-07 10:20:29,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:20:29,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:20:29,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:20:29,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:20:29,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:20:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7095 backedges. 36 proven. 1364 refuted. 0 times theorem prover too weak. 5695 trivial. 0 not checked. [2019-09-07 10:20:29,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:29,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 28] total 81 [2019-09-07 10:20:29,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-07 10:20:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-07 10:20:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2008, Invalid=4472, Unknown=0, NotChecked=0, Total=6480 [2019-09-07 10:20:29,659 INFO L87 Difference]: Start difference. First operand 344 states and 398 transitions. Second operand 81 states. [2019-09-07 10:20:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:35,511 INFO L93 Difference]: Finished difference Result 600 states and 713 transitions. [2019-09-07 10:20:35,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-07 10:20:35,511 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 341 [2019-09-07 10:20:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:35,514 INFO L225 Difference]: With dead ends: 600 [2019-09-07 10:20:35,514 INFO L226 Difference]: Without dead ends: 527 [2019-09-07 10:20:35,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8811 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7899, Invalid=25773, Unknown=0, NotChecked=0, Total=33672 [2019-09-07 10:20:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-07 10:20:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 517. [2019-09-07 10:20:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-09-07 10:20:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 624 transitions. [2019-09-07 10:20:35,551 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 624 transitions. Word has length 341 [2019-09-07 10:20:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:35,551 INFO L475 AbstractCegarLoop]: Abstraction has 517 states and 624 transitions. [2019-09-07 10:20:35,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-07 10:20:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 624 transitions. [2019-09-07 10:20:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-07 10:20:35,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:35,553 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:35,553 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:35,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:35,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1541155009, now seen corresponding path program 22 times [2019-09-07 10:20:35,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:35,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:35,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:35,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:20:35,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7252 backedges. 16 proven. 2809 refuted. 0 times theorem prover too weak. 4427 trivial. 0 not checked. [2019-09-07 10:20:36,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:36,726 INFO L223 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-09-07 10:20:36,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:20:36,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:20:36,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:20:36,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 10:20:36,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7252 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 4443 trivial. 0 not checked. [2019-09-07 10:20:36,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:36,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-07 10:20:36,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 10:20:36,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 10:20:36,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:20:36,926 INFO L87 Difference]: Start difference. First operand 517 states and 624 transitions. Second operand 57 states. [2019-09-07 10:20:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:37,167 INFO L93 Difference]: Finished difference Result 924 states and 1138 transitions. [2019-09-07 10:20:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 10:20:37,167 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 344 [2019-09-07 10:20:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:37,170 INFO L225 Difference]: With dead ends: 924 [2019-09-07 10:20:37,170 INFO L226 Difference]: Without dead ends: 520 [2019-09-07 10:20:37,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:20:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-07 10:20:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 519. [2019-09-07 10:20:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-07 10:20:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 626 transitions. [2019-09-07 10:20:37,217 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 626 transitions. Word has length 344 [2019-09-07 10:20:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:37,217 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 626 transitions. [2019-09-07 10:20:37,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 10:20:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 626 transitions. [2019-09-07 10:20:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-07 10:20:37,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:37,219 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 52, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:37,219 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:37,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:37,219 INFO L82 PathProgramCache]: Analyzing trace with hash 910117985, now seen corresponding path program 23 times [2019-09-07 10:20:37,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:37,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:37,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:37,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:20:37,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7359 backedges. 16 proven. 4187 refuted. 0 times theorem prover too weak. 3156 trivial. 0 not checked. [2019-09-07 10:20:38,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:38,339 INFO L223 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-09-07 10:20:38,349 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:21:24,811 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-09-07 10:21:24,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:24,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 10:21:24,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7359 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 4443 trivial. 0 not checked. [2019-09-07 10:21:27,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:27,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 57] total 111 [2019-09-07 10:21:27,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-07 10:21:27,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-07 10:21:27,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 10:21:27,076 INFO L87 Difference]: Start difference. First operand 519 states and 626 transitions. Second operand 111 states. [2019-09-07 10:21:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:27,746 INFO L93 Difference]: Finished difference Result 936 states and 1156 transitions. [2019-09-07 10:21:27,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-07 10:21:27,746 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 346 [2019-09-07 10:21:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:27,748 INFO L225 Difference]: With dead ends: 936 [2019-09-07 10:21:27,749 INFO L226 Difference]: Without dead ends: 532 [2019-09-07 10:21:27,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2915 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 10:21:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-09-07 10:21:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 527. [2019-09-07 10:21:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-07 10:21:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 636 transitions. [2019-09-07 10:21:27,784 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 636 transitions. Word has length 346 [2019-09-07 10:21:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:27,784 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 636 transitions. [2019-09-07 10:21:27,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-07 10:21:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 636 transitions. [2019-09-07 10:21:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-07 10:21:27,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:27,786 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 53, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:27,786 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:27,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1453808683, now seen corresponding path program 24 times [2019-09-07 10:21:27,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:27,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:27,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:27,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:27,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7628 backedges. 16 proven. 4347 refuted. 0 times theorem prover too weak. 3265 trivial. 0 not checked. [2019-09-07 10:21:28,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:28,985 INFO L223 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-09-07 10:21:28,997 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:22:32,836 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) [2019-09-07 10:22:32,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:22:32,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 10:22:32,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:34,757 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:22:34,758 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 32 treesize of output 22 [2019-09-07 10:22:34,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:22:34,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:22:34,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:22:34,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:22:34,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 10:22:34,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:22:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7628 backedges. 155 proven. 1431 refuted. 0 times theorem prover too weak. 6042 trivial. 0 not checked. [2019-09-07 10:22:35,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:35,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 31] total 86 [2019-09-07 10:22:35,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-07 10:22:35,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-07 10:22:35,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2167, Invalid=5143, Unknown=0, NotChecked=0, Total=7310 [2019-09-07 10:22:35,148 INFO L87 Difference]: Start difference. First operand 527 states and 636 transitions. Second operand 86 states. [2019-09-07 10:22:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:49,523 INFO L93 Difference]: Finished difference Result 701 states and 817 transitions. [2019-09-07 10:22:49,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2019-09-07 10:22:49,524 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 351 [2019-09-07 10:22:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:49,527 INFO L225 Difference]: With dead ends: 701 [2019-09-07 10:22:49,528 INFO L226 Difference]: Without dead ends: 589 [2019-09-07 10:22:49,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 308 SyntacticMatches, 15 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28927 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=17041, Invalid=58859, Unknown=0, NotChecked=0, Total=75900 [2019-09-07 10:22:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-07 10:22:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 365. [2019-09-07 10:22:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-09-07 10:22:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 422 transitions. [2019-09-07 10:22:49,554 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 422 transitions. Word has length 351 [2019-09-07 10:22:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:49,554 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 422 transitions. [2019-09-07 10:22:49,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-07 10:22:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 422 transitions. [2019-09-07 10:22:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-07 10:22:49,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:49,556 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:49,556 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:49,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1504836356, now seen corresponding path program 46 times [2019-09-07 10:22:49,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:49,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:49,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:49,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:22:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7859 backedges. 18 proven. 3025 refuted. 0 times theorem prover too weak. 4816 trivial. 0 not checked. [2019-09-07 10:22:50,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:50,842 INFO L223 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-09-07 10:22:50,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:22:50,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:22:50,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:22:50,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 10:22:50,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7859 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 4834 trivial. 0 not checked. [2019-09-07 10:22:51,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:51,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-09-07 10:22:51,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 10:22:51,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 10:22:51,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:22:51,064 INFO L87 Difference]: Start difference. First operand 365 states and 422 transitions. Second operand 59 states. [2019-09-07 10:22:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:51,283 INFO L93 Difference]: Finished difference Result 616 states and 730 transitions. [2019-09-07 10:22:51,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 10:22:51,283 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 362 [2019-09-07 10:22:51,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:51,285 INFO L225 Difference]: With dead ends: 616 [2019-09-07 10:22:51,285 INFO L226 Difference]: Without dead ends: 368 [2019-09-07 10:22:51,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:22:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-07 10:22:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 367. [2019-09-07 10:22:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-07 10:22:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 424 transitions. [2019-09-07 10:22:51,307 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 424 transitions. Word has length 362 [2019-09-07 10:22:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:51,308 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 424 transitions. [2019-09-07 10:22:51,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 10:22:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 424 transitions. [2019-09-07 10:22:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-07 10:22:51,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:51,311 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:51,311 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash 922170782, now seen corresponding path program 47 times [2019-09-07 10:22:51,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:51,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:51,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:22:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7970 backedges. 18 proven. 4510 refuted. 0 times theorem prover too weak. 3442 trivial. 0 not checked. [2019-09-07 10:22:52,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:52,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:22:52,702 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:23:36,285 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2019-09-07 10:23:36,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:23:36,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 10:23:36,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:23:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7970 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 4834 trivial. 0 not checked. [2019-09-07 10:23:38,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:23:38,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 59] total 115 [2019-09-07 10:23:38,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-07 10:23:38,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-07 10:23:38,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2019-09-07 10:23:38,737 INFO L87 Difference]: Start difference. First operand 367 states and 424 transitions. Second operand 115 states. [2019-09-07 10:23:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:23:39,370 INFO L93 Difference]: Finished difference Result 623 states and 740 transitions. [2019-09-07 10:23:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-07 10:23:39,371 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 364 [2019-09-07 10:23:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:23:39,372 INFO L225 Difference]: With dead ends: 623 [2019-09-07 10:23:39,373 INFO L226 Difference]: Without dead ends: 375 [2019-09-07 10:23:39,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3135 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2019-09-07 10:23:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-07 10:23:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2019-09-07 10:23:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-07 10:23:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 430 transitions. [2019-09-07 10:23:39,397 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 430 transitions. Word has length 364 [2019-09-07 10:23:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:23:39,397 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 430 transitions. [2019-09-07 10:23:39,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-07 10:23:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 430 transitions. [2019-09-07 10:23:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-07 10:23:39,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:23:39,399 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:23:39,399 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:23:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:23:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash -202987254, now seen corresponding path program 48 times [2019-09-07 10:23:39,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:23:39,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:23:39,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:39,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:23:39,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:23:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8249 backedges. 18 proven. 4676 refuted. 0 times theorem prover too weak. 3555 trivial. 0 not checked. [2019-09-07 10:23:40,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:23:40,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:23:40,732 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:26:10,769 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2019-09-07 10:26:10,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:26:10,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 10:26:10,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8249 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 3573 trivial. 0 not checked. [2019-09-07 10:26:10,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:10,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-09-07 10:26:10,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-07 10:26:10,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-07 10:26:10,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:26:10,926 INFO L87 Difference]: Start difference. First operand 372 states and 430 transitions. Second operand 60 states. [2019-09-07 10:26:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:11,341 INFO L93 Difference]: Finished difference Result 458 states and 519 transitions. [2019-09-07 10:26:11,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 10:26:11,342 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 369 [2019-09-07 10:26:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:11,343 INFO L225 Difference]: With dead ends: 458 [2019-09-07 10:26:11,343 INFO L226 Difference]: Without dead ends: 377 [2019-09-07 10:26:11,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:26:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-07 10:26:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2019-09-07 10:26:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-07 10:26:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 434 transitions. [2019-09-07 10:26:11,366 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 434 transitions. Word has length 369 [2019-09-07 10:26:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:11,366 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 434 transitions. [2019-09-07 10:26:11,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-07 10:26:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 434 transitions. [2019-09-07 10:26:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-07 10:26:11,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:11,368 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:11,368 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:11,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:11,368 INFO L82 PathProgramCache]: Analyzing trace with hash 587827584, now seen corresponding path program 49 times [2019-09-07 10:26:11,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:11,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:11,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:26:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8418 backedges. 18 proven. 3249 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-09-07 10:26:12,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:12,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:12,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:26:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:12,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 10:26:12,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8418 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 5169 trivial. 0 not checked. [2019-09-07 10:26:12,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:12,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-09-07 10:26:12,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 10:26:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 10:26:12,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:26:12,929 INFO L87 Difference]: Start difference. First operand 375 states and 434 transitions. Second operand 61 states. [2019-09-07 10:26:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:13,180 INFO L93 Difference]: Finished difference Result 632 states and 750 transitions. [2019-09-07 10:26:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 10:26:13,181 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 372 [2019-09-07 10:26:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:13,182 INFO L225 Difference]: With dead ends: 632 [2019-09-07 10:26:13,182 INFO L226 Difference]: Without dead ends: 378 [2019-09-07 10:26:13,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:26:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-07 10:26:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-09-07 10:26:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-07 10:26:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 436 transitions. [2019-09-07 10:26:13,205 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 436 transitions. Word has length 372 [2019-09-07 10:26:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:13,205 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 436 transitions. [2019-09-07 10:26:13,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 10:26:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 436 transitions. [2019-09-07 10:26:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-07 10:26:13,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:13,207 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:13,207 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:13,207 INFO L82 PathProgramCache]: Analyzing trace with hash -827336798, now seen corresponding path program 50 times [2019-09-07 10:26:13,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:13,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:13,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:26:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8533 backedges. 18 proven. 4845 refuted. 0 times theorem prover too weak. 3670 trivial. 0 not checked. [2019-09-07 10:26:14,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:14,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:14,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:26:14,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:26:14,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:26:14,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 10:26:14,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8533 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 5169 trivial. 0 not checked. [2019-09-07 10:26:17,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:17,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 61] total 119 [2019-09-07 10:26:17,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-07 10:26:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-07 10:26:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2019-09-07 10:26:17,349 INFO L87 Difference]: Start difference. First operand 377 states and 436 transitions. Second operand 119 states. [2019-09-07 10:26:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:18,105 INFO L93 Difference]: Finished difference Result 639 states and 760 transitions. [2019-09-07 10:26:18,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-07 10:26:18,105 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 374 [2019-09-07 10:26:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:18,107 INFO L225 Difference]: With dead ends: 639 [2019-09-07 10:26:18,107 INFO L226 Difference]: Without dead ends: 385 [2019-09-07 10:26:18,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2019-09-07 10:26:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-07 10:26:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2019-09-07 10:26:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-07 10:26:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 442 transitions. [2019-09-07 10:26:18,130 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 442 transitions. Word has length 374 [2019-09-07 10:26:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:18,131 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 442 transitions. [2019-09-07 10:26:18,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-07 10:26:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 442 transitions. [2019-09-07 10:26:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-09-07 10:26:18,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:18,133 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:18,133 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2095966982, now seen corresponding path program 51 times [2019-09-07 10:26:18,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:18,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:18,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:26:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8822 backedges. 18 proven. 5017 refuted. 0 times theorem prover too weak. 3787 trivial. 0 not checked. [2019-09-07 10:26:19,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:19,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:19,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:26:24,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-07 10:26:24,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:26:24,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 10:26:24,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:25,593 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-09-07 10:26:25,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:26:25,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:26:25,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:26:25,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:26:25,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:26:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8822 backedges. 41 proven. 1700 refuted. 0 times theorem prover too weak. 7081 trivial. 0 not checked. [2019-09-07 10:26:25,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:25,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 30] total 89 [2019-09-07 10:26:25,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-07 10:26:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-07 10:26:25,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2464, Invalid=5368, Unknown=0, NotChecked=0, Total=7832 [2019-09-07 10:26:25,947 INFO L87 Difference]: Start difference. First operand 382 states and 442 transitions. Second operand 89 states. [2019-09-07 10:26:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:33,384 INFO L93 Difference]: Finished difference Result 665 states and 790 transitions. [2019-09-07 10:26:33,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-07 10:26:33,384 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 379 [2019-09-07 10:26:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:33,387 INFO L225 Difference]: With dead ends: 665 [2019-09-07 10:26:33,388 INFO L226 Difference]: Without dead ends: 584 [2019-09-07 10:26:33,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10745 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=9682, Invalid=31324, Unknown=0, NotChecked=0, Total=41006 [2019-09-07 10:26:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-07 10:26:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 574. [2019-09-07 10:26:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-07 10:26:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 693 transitions. [2019-09-07 10:26:33,432 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 693 transitions. Word has length 379 [2019-09-07 10:26:33,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:33,432 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 693 transitions. [2019-09-07 10:26:33,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-07 10:26:33,433 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 693 transitions. [2019-09-07 10:26:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-07 10:26:33,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:33,435 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:33,435 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:33,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2052158974, now seen corresponding path program 25 times [2019-09-07 10:26:33,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:33,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:33,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:33,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:26:33,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8997 backedges. 18 proven. 3481 refuted. 0 times theorem prover too weak. 5498 trivial. 0 not checked. [2019-09-07 10:26:34,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:34,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:34,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:26:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:35,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-07 10:26:35,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8997 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 5516 trivial. 0 not checked. [2019-09-07 10:26:35,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:35,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-09-07 10:26:35,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 10:26:35,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 10:26:35,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:26:35,155 INFO L87 Difference]: Start difference. First operand 574 states and 693 transitions. Second operand 63 states. [2019-09-07 10:26:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:35,406 INFO L93 Difference]: Finished difference Result 1026 states and 1264 transitions. [2019-09-07 10:26:35,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 10:26:35,407 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 382 [2019-09-07 10:26:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:35,409 INFO L225 Difference]: With dead ends: 1026 [2019-09-07 10:26:35,409 INFO L226 Difference]: Without dead ends: 577 [2019-09-07 10:26:35,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:26:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-07 10:26:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 576. [2019-09-07 10:26:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-07 10:26:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 695 transitions. [2019-09-07 10:26:35,470 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 695 transitions. Word has length 382 [2019-09-07 10:26:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:35,470 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 695 transitions. [2019-09-07 10:26:35,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 10:26:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 695 transitions. [2019-09-07 10:26:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-07 10:26:35,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:35,472 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 58, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:35,472 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash -827648604, now seen corresponding path program 26 times [2019-09-07 10:26:35,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:35,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:35,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:26:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9116 backedges. 18 proven. 5192 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2019-09-07 10:26:36,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:36,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:36,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:26:37,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:26:37,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:26:37,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-07 10:26:37,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9116 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 5516 trivial. 0 not checked. [2019-09-07 10:26:39,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:39,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 63] total 123 [2019-09-07 10:26:39,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-07 10:26:39,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-07 10:26:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2019-09-07 10:26:39,785 INFO L87 Difference]: Start difference. First operand 576 states and 695 transitions. Second operand 123 states. [2019-09-07 10:26:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:40,593 INFO L93 Difference]: Finished difference Result 1038 states and 1282 transitions. [2019-09-07 10:26:40,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-07 10:26:40,594 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 384 [2019-09-07 10:26:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:40,596 INFO L225 Difference]: With dead ends: 1038 [2019-09-07 10:26:40,596 INFO L226 Difference]: Without dead ends: 589 [2019-09-07 10:26:40,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3599 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2019-09-07 10:26:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-07 10:26:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 584. [2019-09-07 10:26:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-07 10:26:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 705 transitions. [2019-09-07 10:26:40,638 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 705 transitions. Word has length 384 [2019-09-07 10:26:40,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:40,639 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 705 transitions. [2019-09-07 10:26:40,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-07 10:26:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 705 transitions. [2019-09-07 10:26:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-07 10:26:40,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:40,641 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 59, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:40,641 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1556289792, now seen corresponding path program 27 times [2019-09-07 10:26:40,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:40,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:40,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:40,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:26:40,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9415 backedges. 18 proven. 5370 refuted. 0 times theorem prover too weak. 4027 trivial. 0 not checked. [2019-09-07 10:26:42,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:42,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:42,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:26:47,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-07 10:26:47,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:26:47,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 10:26:47,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:50,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:26:50,176 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 32 treesize of output 22 [2019-09-07 10:26:50,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:26:50,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:26:50,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:26:50,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:26:50,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 10:26:50,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:26:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9415 backedges. 173 proven. 1775 refuted. 0 times theorem prover too weak. 7467 trivial. 0 not checked. [2019-09-07 10:26:50,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:50,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33] total 94 [2019-09-07 10:26:50,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-07 10:26:50,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-07 10:26:50,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2639, Invalid=6103, Unknown=0, NotChecked=0, Total=8742 [2019-09-07 10:26:50,636 INFO L87 Difference]: Start difference. First operand 584 states and 705 transitions. Second operand 94 states. [2019-09-07 10:27:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:07,859 INFO L93 Difference]: Finished difference Result 774 states and 902 transitions. [2019-09-07 10:27:07,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2019-09-07 10:27:07,859 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 389 [2019-09-07 10:27:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:07,862 INFO L225 Difference]: With dead ends: 774 [2019-09-07 10:27:07,862 INFO L226 Difference]: Without dead ends: 650 [2019-09-07 10:27:07,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 342 SyntacticMatches, 17 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35397 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=20783, Invalid=71329, Unknown=0, NotChecked=0, Total=92112 [2019-09-07 10:27:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-07 10:27:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 403. [2019-09-07 10:27:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-07 10:27:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 466 transitions. [2019-09-07 10:27:07,893 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 466 transitions. Word has length 389 [2019-09-07 10:27:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:07,893 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 466 transitions. [2019-09-07 10:27:07,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-07 10:27:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 466 transitions. [2019-09-07 10:27:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-07 10:27:07,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:07,895 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:07,895 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1362241857, now seen corresponding path program 52 times [2019-09-07 10:27:07,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:07,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:07,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:07,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:07,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9672 backedges. 20 proven. 3721 refuted. 0 times theorem prover too weak. 5931 trivial. 0 not checked. [2019-09-07 10:27:09,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:09,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:27:09,409 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:27:09,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:27:09,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:09,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-07 10:27:09,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9672 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 5951 trivial. 0 not checked. [2019-09-07 10:27:09,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:09,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-09-07 10:27:09,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-07 10:27:09,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-07 10:27:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 10:27:09,661 INFO L87 Difference]: Start difference. First operand 403 states and 466 transitions. Second operand 65 states. [2019-09-07 10:27:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:09,898 INFO L93 Difference]: Finished difference Result 680 states and 806 transitions. [2019-09-07 10:27:09,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 10:27:09,899 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 400 [2019-09-07 10:27:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:09,900 INFO L225 Difference]: With dead ends: 680 [2019-09-07 10:27:09,900 INFO L226 Difference]: Without dead ends: 406 [2019-09-07 10:27:09,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 10:27:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-07 10:27:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-09-07 10:27:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-07 10:27:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 468 transitions. [2019-09-07 10:27:09,926 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 468 transitions. Word has length 400 [2019-09-07 10:27:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:09,927 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 468 transitions. [2019-09-07 10:27:09,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-07 10:27:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 468 transitions. [2019-09-07 10:27:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-07 10:27:09,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:09,929 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:09,929 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash -642810399, now seen corresponding path program 53 times [2019-09-07 10:27:09,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:09,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:09,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9795 backedges. 20 proven. 5551 refuted. 0 times theorem prover too weak. 4224 trivial. 0 not checked. [2019-09-07 10:27:11,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:11,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:27:11,602 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:27:42,515 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2019-09-07 10:27:42,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:42,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-07 10:27:42,545 INFO L279 TraceCheckSpWp]: Computing forward predicates...