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-crafted/xor1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:00:46,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:00:46,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:00:46,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:00:46,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:00:46,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:00:46,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:00:46,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:00:46,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:00:46,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:00:46,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:00:46,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:00:46,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:00:46,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:00:46,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:00:46,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:00:46,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:00:46,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:00:46,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:00:46,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:00:46,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:00:46,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:00:46,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:00:46,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:00:46,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:00:46,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:00:46,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:00:46,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:00:46,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:00:46,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:00:46,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:00:46,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:00:46,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:00:46,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:00:46,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:00:46,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:00:46,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:00:46,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:00:46,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:00:46,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:00:46,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:00:46,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:00:46,283 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:00:46,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:00:46,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:00:46,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:00:46,285 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:00:46,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:00:46,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:00:46,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:00:46,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:00:46,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:00:46,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:00:46,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:00:46,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:00:46,287 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:00:46,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:00:46,287 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:00:46,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:00:46,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:00:46,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:00:46,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:00:46,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:00:46,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:00:46,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:00:46,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:00:46,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:00:46,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:00:46,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:00:46,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:00:46,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:00:46,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:00:46,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:00:46,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:00:46,339 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:00:46,339 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:00:46,340 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor1.i [2019-10-01 22:00:46,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebbe70e5/a7c28653e21f44f685d32c49e3d6a85e/FLAGad9a97e7d [2019-10-01 22:00:46,878 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:00:46,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor1.i [2019-10-01 22:00:46,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebbe70e5/a7c28653e21f44f685d32c49e3d6a85e/FLAGad9a97e7d [2019-10-01 22:00:47,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebbe70e5/a7c28653e21f44f685d32c49e3d6a85e [2019-10-01 22:00:47,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:00:47,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:00:47,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:47,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:00:47,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:00:47,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3595e1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47, skipping insertion in model container [2019-10-01 22:00:47,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,264 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:00:47,284 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:00:47,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:47,578 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:00:47,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:47,736 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:00:47,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47 WrapperNode [2019-10-01 22:00:47,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:47,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:00:47,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:00:47,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:00:47,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... [2019-10-01 22:00:47,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:00:47,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:00:47,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:00:47,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:00:47,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:00:47,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:00:47,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:00:47,872 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2019-10-01 22:00:47,872 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:00:47,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:00:47,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:00:47,873 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2019-10-01 22:00:47,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:00:47,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:00:47,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:00:47,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:00:47,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:00:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:00:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:00:48,204 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:00:48,204 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 22:00:48,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:48 BoogieIcfgContainer [2019-10-01 22:00:48,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:00:48,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:00:48,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:00:48,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:00:48,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:00:47" (1/3) ... [2019-10-01 22:00:48,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b0cc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:48, skipping insertion in model container [2019-10-01 22:00:48,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:47" (2/3) ... [2019-10-01 22:00:48,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b0cc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:48, skipping insertion in model container [2019-10-01 22:00:48,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:48" (3/3) ... [2019-10-01 22:00:48,214 INFO L109 eAbstractionObserver]: Analyzing ICFG xor1.i [2019-10-01 22:00:48,224 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:00:48,232 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:00:48,249 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:00:48,282 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:00:48,282 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:00:48,282 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:00:48,283 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:00:48,283 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:00:48,283 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:00:48,283 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:00:48,283 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:00:48,283 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:00:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 22:00:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:00:48,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,307 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,309 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2019-10-01 22:00:48,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:00:48,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:48,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:00:48,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:00:48,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:00:48,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:00:48,512 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 22:00:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,544 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 22:00:48,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:00:48,546 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 22:00:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,557 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:48,557 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:00:48,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:00:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:00:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:00:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:00:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 22:00:48,604 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 22:00:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,605 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 22:00:48,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:00:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 22:00:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:00:48,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,608 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,608 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,609 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2019-10-01 22:00:48,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:00:48,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:48,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:48,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:48,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:48,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:48,706 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 22:00:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,737 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 22:00:48,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:48,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 22:00:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,740 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:48,740 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:00:48,741 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:00:48,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 22:00:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:00:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 22:00:48,749 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 22:00:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,750 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 22:00:48,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 22:00:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:00:48,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,752 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,752 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2019-10-01 22:00:48,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:00:48,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:48,837 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:48,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 22:00:48,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 22:00:48,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:00:48,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 22:00:48,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 22:00:48,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 22:00:48,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:00:48,967 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 22:00:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,995 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 22:00:48,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:48,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 22:00:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,998 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:48,998 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:00:48,999 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:00:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:00:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 22:00:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:00:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 22:00:49,006 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 22:00:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,006 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 22:00:49,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 22:00:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 22:00:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 22:00:49,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,008 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,008 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times [2019-10-01 22:00:49,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:49,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:49,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:49,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:49,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:49,137 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 22:00:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,163 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 22:00:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:49,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 22:00:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,167 INFO L225 Difference]: With dead ends: 43 [2019-10-01 22:00:49,168 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:00:49,168 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:00:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 22:00:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 22:00:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 22:00:49,175 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 22:00:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,177 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 22:00:49,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 22:00:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:00:49,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,179 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,180 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,180 INFO L82 PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times [2019-10-01 22:00:49,181 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:49,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,260 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:49,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:49,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:00:49,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:00:49,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:00:49,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:00:49,365 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 22:00:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,389 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 22:00:49,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:00:49,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 22:00:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,391 INFO L225 Difference]: With dead ends: 52 [2019-10-01 22:00:49,391 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 22:00:49,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:00:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 22:00:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 22:00:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:00:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 22:00:49,398 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 22:00:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,398 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 22:00:49,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:00:49,399 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 22:00:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:00:49,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,400 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,401 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash 4791275, now seen corresponding path program 2 times [2019-10-01 22:00:49,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:49,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,466 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:49,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:49,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:49,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:49,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:49,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:00:49,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:00:49,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:00:49,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:00:49,591 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 22:00:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,621 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 22:00:49,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:00:49,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 22:00:49,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,623 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:49,623 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 22:00:49,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:00:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 22:00:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 22:00:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 22:00:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 22:00:49,629 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 22:00:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,630 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 22:00:49,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:00:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 22:00:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 22:00:49,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,631 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,632 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1841935693, now seen corresponding path program 3 times [2019-10-01 22:00:49,632 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:49,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:49,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,752 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:49,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 22:00:49,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:49,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:00:49,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:49,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 22:00:49,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:49,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:49,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:49,852 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 22:00:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,916 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 22:00:49,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:00:49,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 22:00:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,918 INFO L225 Difference]: With dead ends: 59 [2019-10-01 22:00:49,918 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:00:49,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:00:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 22:00:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 22:00:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 22:00:49,925 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 22:00:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,925 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 22:00:49,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 22:00:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 22:00:49,927 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,927 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,927 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1174865395, now seen corresponding path program 4 times [2019-10-01 22:00:49,928 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:00:50,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,041 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:50,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:50,107 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:50,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:50,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:00:50,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:00:50,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:50,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:50,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:50,150 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 22:00:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,197 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 22:00:50,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:00:50,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 22:00:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,199 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:00:50,199 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 22:00:50,200 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 22:00:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 22:00:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 22:00:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 22:00:50,206 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 22:00:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,206 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 22:00:50,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 22:00:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 22:00:50,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,208 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:50,208 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,209 INFO L82 PathProgramCache]: Analyzing trace with hash -170213137, now seen corresponding path program 5 times [2019-10-01 22:00:50,209 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:50,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:00:50,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,337 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:50,374 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:50,427 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:00:50,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:50,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 22:00:50,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 22:00:50,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:50,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:50,519 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 22:00:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,577 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 22:00:50,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:50,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 22:00:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,580 INFO L225 Difference]: With dead ends: 67 [2019-10-01 22:00:50,580 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 22:00:50,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 22:00:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 22:00:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:00:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 22:00:50,596 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 22:00:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,597 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 22:00:50,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 22:00:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 22:00:50,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,599 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:50,599 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash 778875311, now seen corresponding path program 6 times [2019-10-01 22:00:50,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:50,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 22:00:50,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,743 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:50,769 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:50,815 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 22:00:50,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:50,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-01 22:00:50,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 22:00:50,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:50,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:50,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:50,877 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 22:00:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,942 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 22:00:50,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:50,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 22:00:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,943 INFO L225 Difference]: With dead ends: 73 [2019-10-01 22:00:50,944 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:00:50,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:00:50,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 22:00:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:00:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 22:00:50,961 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 22:00:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,962 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 22:00:50,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 22:00:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 22:00:50,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,967 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:50,967 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,967 INFO L82 PathProgramCache]: Analyzing trace with hash -122717169, now seen corresponding path program 7 times [2019-10-01 22:00:50,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:50,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:51,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,086 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:51,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:00:51,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:51,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:00:51,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:51,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:51,210 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 22:00:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,258 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 22:00:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:00:51,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 22:00:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,262 INFO L225 Difference]: With dead ends: 76 [2019-10-01 22:00:51,262 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 22:00:51,265 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 22:00:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 22:00:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 22:00:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 22:00:51,278 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 22:00:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,278 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 22:00:51,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 22:00:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 22:00:51,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,280 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:51,280 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1588760433, now seen corresponding path program 8 times [2019-10-01 22:00:51,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:51,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:51,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,406 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:51,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:51,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:51,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:51,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:00:51,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:51,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:00:51,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:00:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:00:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:00:51,539 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 22:00:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,589 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 22:00:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:51,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 22:00:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,591 INFO L225 Difference]: With dead ends: 78 [2019-10-01 22:00:51,591 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 22:00:51,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:00:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 22:00:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 22:00:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 22:00:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 22:00:51,602 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 22:00:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,603 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 22:00:51,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:00:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 22:00:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 22:00:51,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,607 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:51,607 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1346261587, now seen corresponding path program 9 times [2019-10-01 22:00:51,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:51,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:51,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,734 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:51,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:51,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 22:00:51,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:51,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:51,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 22:00:51,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 22:00:51,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:00:51,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:00:51,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:00:51,843 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 22:00:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,910 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 22:00:51,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:00:51,911 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 22:00:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,912 INFO L225 Difference]: With dead ends: 83 [2019-10-01 22:00:51,912 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 22:00:51,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:00:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 22:00:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 22:00:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 22:00:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 22:00:51,927 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 22:00:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,928 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 22:00:51,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:00:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 22:00:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 22:00:51,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,929 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:51,929 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2116910669, now seen corresponding path program 10 times [2019-10-01 22:00:51,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:51,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 22:00:52,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:52,077 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:52,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:52,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:52,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:52,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-01 22:00:52,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:52,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 22:00:52,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:00:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:00:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:52,200 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 22:00:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,272 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 22:00:52,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:00:52,272 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 22:00:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,273 INFO L225 Difference]: With dead ends: 89 [2019-10-01 22:00:52,274 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 22:00:52,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 22:00:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 22:00:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 22:00:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 22:00:52,280 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 22:00:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,281 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 22:00:52,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:00:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 22:00:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 22:00:52,282 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,282 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:52,282 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,282 INFO L82 PathProgramCache]: Analyzing trace with hash 343984243, now seen corresponding path program 11 times [2019-10-01 22:00:52,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:52,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 22:00:52,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:52,430 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:52,464 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:00:52,700 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 22:00:52,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:52,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-01 22:00:52,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:52,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 22:00:52,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:00:52,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:00:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:52,777 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 22:00:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,857 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 22:00:52,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:52,857 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 22:00:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,858 INFO L225 Difference]: With dead ends: 95 [2019-10-01 22:00:52,858 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 22:00:52,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:52,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 22:00:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 22:00:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:00:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 22:00:52,870 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 22:00:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,872 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 22:00:52,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:00:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 22:00:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 22:00:52,873 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,874 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:52,874 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1658502451, now seen corresponding path program 12 times [2019-10-01 22:00:52,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-01 22:00:53,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:53,058 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:53,083 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:53,349 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 22:00:53,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:53,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:00:53,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-10-01 22:00:53,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 22:00:53,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:00:53,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:00:53,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:53,408 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 22:00:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:53,530 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 22:00:53,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:53,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 22:00:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:53,533 INFO L225 Difference]: With dead ends: 101 [2019-10-01 22:00:53,533 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:00:53,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:53,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:00:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 22:00:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 22:00:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 22:00:53,551 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 22:00:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:53,552 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 22:00:53,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:00:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 22:00:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 22:00:53,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:53,556 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:53,556 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:53,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1949368429, now seen corresponding path program 13 times [2019-10-01 22:00:53,557 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:53,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:53,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:53,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:53,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:53,769 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:53,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:00:53,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:53,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:00:53,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:00:53,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:00:53,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:53,898 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 22:00:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:53,968 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 22:00:53,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:00:53,969 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 22:00:53,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:53,970 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:00:53,970 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 22:00:53,971 INFO L640 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-10-01 22:00:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 22:00:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 22:00:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 22:00:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 22:00:53,976 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 22:00:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:53,977 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 22:00:53,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:00:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 22:00:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 22:00:53,979 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:53,979 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:53,980 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:53,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1574767605, now seen corresponding path program 14 times [2019-10-01 22:00:53,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:53,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:53,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:53,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:53,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:54,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:54,186 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:54,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:54,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:54,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:54,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:00:54,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:54,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:54,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:00:54,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:00:54,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:00:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:00:54,316 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 22:00:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,379 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 22:00:54,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:00:54,380 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 22:00:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,380 INFO L225 Difference]: With dead ends: 106 [2019-10-01 22:00:54,381 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 22:00:54,383 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:00:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 22:00:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 22:00:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 22:00:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 22:00:54,395 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 22:00:54,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,395 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 22:00:54,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:00:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 22:00:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 22:00:54,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,397 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:54,397 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,397 INFO L82 PathProgramCache]: Analyzing trace with hash -459700265, now seen corresponding path program 15 times [2019-10-01 22:00:54,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:54,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:54,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:54,612 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:54,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:54,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:00:54,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:54,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:00:54,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-01 22:00:54,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:54,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 22:00:54,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:00:54,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:00:54,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:54,814 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 22:00:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,910 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 22:00:54,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:00:54,911 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 22:00:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,912 INFO L225 Difference]: With dead ends: 111 [2019-10-01 22:00:54,912 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 22:00:54,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 22:00:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 22:00:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 22:00:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 22:00:54,918 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 22:00:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,918 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 22:00:54,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:00:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 22:00:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 22:00:54,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,920 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:54,920 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,920 INFO L82 PathProgramCache]: Analyzing trace with hash -727614313, now seen corresponding path program 16 times [2019-10-01 22:00:54,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:54,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 22:00:55,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:55,121 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:55,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:55,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:55,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:55,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:00:55,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:55,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:55,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:00:55,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:00:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:00:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:00:55,240 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 22:00:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:55,304 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 22:00:55,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:55,304 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 22:00:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:55,305 INFO L225 Difference]: With dead ends: 114 [2019-10-01 22:00:55,305 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 22:00:55,306 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:00:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 22:00:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 22:00:55,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:00:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 22:00:55,310 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 22:00:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:55,311 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 22:00:55,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:00:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 22:00:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 22:00:55,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:55,312 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:55,313 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1948648953, now seen corresponding path program 17 times [2019-10-01 22:00:55,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:55,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:55,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:55,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 22:00:55,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:55,566 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:55,618 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:00:56,082 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 22:00:56,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:56,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:00:56,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-10-01 22:00:56,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:56,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 22:00:56,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:00:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:00:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:56,233 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 22:00:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:56,339 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 22:00:56,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:00:56,340 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 22:00:56,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:56,341 INFO L225 Difference]: With dead ends: 119 [2019-10-01 22:00:56,341 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 22:00:56,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 22:00:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 22:00:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 22:00:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 22:00:56,346 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 22:00:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:56,346 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 22:00:56,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:00:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 22:00:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 22:00:56,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:56,348 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:56,348 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:56,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:56,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1322362553, now seen corresponding path program 18 times [2019-10-01 22:00:56,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:56,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:56,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:56,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-10-01 22:00:56,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:56,568 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:56,602 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:56,809 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 22:00:56,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:56,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:00:56,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 269 proven. 16 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-01 22:00:56,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:56,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2019-10-01 22:00:56,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:00:56,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:00:56,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=483, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:00:56,934 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 28 states. [2019-10-01 22:00:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:57,179 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-10-01 22:00:57,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:00:57,182 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2019-10-01 22:00:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:57,183 INFO L225 Difference]: With dead ends: 126 [2019-10-01 22:00:57,184 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 22:00:57,184 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:00:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 22:00:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 22:00:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 22:00:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 22:00:57,189 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 118 [2019-10-01 22:00:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:57,190 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 22:00:57,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:00:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 22:00:57,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 22:00:57,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:57,191 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:57,192 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:57,192 INFO L82 PathProgramCache]: Analyzing trace with hash -415764741, now seen corresponding path program 19 times [2019-10-01 22:00:57,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:57,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:57,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:57,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:57,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:57,455 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:57,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:00:57,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:57,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:57,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:00:57,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:00:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:00:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:57,598 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 22:00:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:57,685 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 22:00:57,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:00:57,686 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 22:00:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:57,687 INFO L225 Difference]: With dead ends: 130 [2019-10-01 22:00:57,688 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 22:00:57,688 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 22:00:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 22:00:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 22:00:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 22:00:57,693 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 22:00:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:57,693 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 22:00:57,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:00:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 22:00:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 22:00:57,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:57,695 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:57,695 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:57,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:57,696 INFO L82 PathProgramCache]: Analyzing trace with hash -946768803, now seen corresponding path program 20 times [2019-10-01 22:00:57,696 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:57,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:57,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:57,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:57,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:57,999 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:58,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:58,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:58,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:58,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:00:58,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:58,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:58,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 22:00:58,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:00:58,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:00:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:00:58,154 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 25 states. [2019-10-01 22:00:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:58,220 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-10-01 22:00:58,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:00:58,221 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2019-10-01 22:00:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:58,222 INFO L225 Difference]: With dead ends: 132 [2019-10-01 22:00:58,222 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 22:00:58,223 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:00:58,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 22:00:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-10-01 22:00:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-01 22:00:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-10-01 22:00:58,228 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 126 [2019-10-01 22:00:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:58,228 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2019-10-01 22:00:58,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:00:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2019-10-01 22:00:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-01 22:00:58,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:58,230 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:58,230 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:58,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:58,230 INFO L82 PathProgramCache]: Analyzing trace with hash -140564161, now seen corresponding path program 21 times [2019-10-01 22:00:58,230 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:58,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:58,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:58,532 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:58,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:58,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 22:00:58,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:58,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:00:58,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2019-10-01 22:00:58,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:58,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 31 [2019-10-01 22:00:58,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:00:58,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:00:58,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:00:58,745 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 31 states. [2019-10-01 22:00:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:58,869 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2019-10-01 22:00:58,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:00:58,870 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2019-10-01 22:00:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:58,871 INFO L225 Difference]: With dead ends: 137 [2019-10-01 22:00:58,871 INFO L226 Difference]: Without dead ends: 97 [2019-10-01 22:00:58,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:00:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-01 22:00:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-10-01 22:00:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 22:00:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 22:00:58,876 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 128 [2019-10-01 22:00:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:58,877 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 22:00:58,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:00:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 22:00:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 22:00:58,878 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:58,878 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:58,878 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:58,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash 145514399, now seen corresponding path program 22 times [2019-10-01 22:00:58,879 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:58,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:58,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:58,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 22:00:59,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:59,189 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:59,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:59,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:59,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:59,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:00:59,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 22:00:59,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:59,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 22:00:59,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:00:59,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:00:59,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:59,323 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 27 states. [2019-10-01 22:00:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:59,408 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2019-10-01 22:00:59,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:00:59,412 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2019-10-01 22:00:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:59,413 INFO L225 Difference]: With dead ends: 140 [2019-10-01 22:00:59,413 INFO L226 Difference]: Without dead ends: 98 [2019-10-01 22:00:59,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-01 22:00:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-10-01 22:00:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 22:00:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-10-01 22:00:59,419 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 132 [2019-10-01 22:00:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:59,420 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-10-01 22:00:59,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:00:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-10-01 22:00:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-01 22:00:59,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:59,421 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:59,421 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:59,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:59,422 INFO L82 PathProgramCache]: Analyzing trace with hash -807181567, now seen corresponding path program 23 times [2019-10-01 22:00:59,422 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:59,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:59,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:59,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:59,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 22:00:59,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:59,778 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:59,808 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:02,150 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 22:01:02,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:02,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:01:02,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2019-10-01 22:01:02,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:02,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2019-10-01 22:01:02,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:01:02,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:01:02,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:02,310 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 35 states. [2019-10-01 22:01:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:02,453 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2019-10-01 22:01:02,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:01:02,457 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2019-10-01 22:01:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:02,458 INFO L225 Difference]: With dead ends: 145 [2019-10-01 22:01:02,458 INFO L226 Difference]: Without dead ends: 103 [2019-10-01 22:01:02,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-01 22:01:02,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-10-01 22:01:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-01 22:01:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-10-01 22:01:02,464 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 134 [2019-10-01 22:01:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:02,465 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-10-01 22:01:02,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:01:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-10-01 22:01:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 22:01:02,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:02,467 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:02,467 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1827973695, now seen corresponding path program 24 times [2019-10-01 22:01:02,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:02,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:02,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:01:02,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:02,855 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:02,884 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:03,535 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 22:01:03,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:03,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:01:03,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-10-01 22:01:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2019-10-01 22:01:03,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:01:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:01:03,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:03,660 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 35 states. [2019-10-01 22:01:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:03,809 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2019-10-01 22:01:03,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:01:03,810 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2019-10-01 22:01:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:03,811 INFO L225 Difference]: With dead ends: 151 [2019-10-01 22:01:03,811 INFO L226 Difference]: Without dead ends: 107 [2019-10-01 22:01:03,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-01 22:01:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-10-01 22:01:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 22:01:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 22:01:03,816 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 142 [2019-10-01 22:01:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:03,817 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 22:01:03,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:01:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 22:01:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 22:01:03,820 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:03,821 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:03,821 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1510967329, now seen corresponding path program 25 times [2019-10-01 22:01:03,821 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:03,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:04,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:04,258 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:04,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:04,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:01:04,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:04,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:04,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 22:01:04,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:01:04,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:01:04,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:01:04,386 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 22:01:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:04,496 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 22:01:04,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:01:04,501 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 22:01:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:04,502 INFO L225 Difference]: With dead ends: 154 [2019-10-01 22:01:04,503 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 22:01:04,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:01:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 22:01:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 22:01:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 22:01:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 22:01:04,509 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 22:01:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:04,509 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 22:01:04,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:01:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 22:01:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 22:01:04,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:04,510 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:04,511 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:04,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1388054525, now seen corresponding path program 26 times [2019-10-01 22:01:04,511 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:04,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:04,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:04,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:04,938 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:04,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:05,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:05,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:05,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:01:05,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:05,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:05,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 22:01:05,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:01:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:01:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:01:05,085 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 31 states. [2019-10-01 22:01:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:05,193 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2019-10-01 22:01:05,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:01:05,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2019-10-01 22:01:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:05,194 INFO L225 Difference]: With dead ends: 156 [2019-10-01 22:01:05,194 INFO L226 Difference]: Without dead ends: 110 [2019-10-01 22:01:05,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:01:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-01 22:01:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-10-01 22:01:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-01 22:01:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2019-10-01 22:01:05,200 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 148 [2019-10-01 22:01:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:05,201 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2019-10-01 22:01:05,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:01:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2019-10-01 22:01:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-01 22:01:05,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:05,202 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:05,202 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash 85718885, now seen corresponding path program 27 times [2019-10-01 22:01:05,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:05,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:05,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:05,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:05,703 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:05,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:05,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:01:05,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:05,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:01:05,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2019-10-01 22:01:06,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:06,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10] total 39 [2019-10-01 22:01:06,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 22:01:06,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 22:01:06,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:01:06,128 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 39 states. [2019-10-01 22:01:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:06,308 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2019-10-01 22:01:06,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 22:01:06,309 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2019-10-01 22:01:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:06,310 INFO L225 Difference]: With dead ends: 161 [2019-10-01 22:01:06,310 INFO L226 Difference]: Without dead ends: 115 [2019-10-01 22:01:06,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:01:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-01 22:01:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2019-10-01 22:01:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-01 22:01:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-10-01 22:01:06,316 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 150 [2019-10-01 22:01:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:06,317 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-10-01 22:01:06,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 22:01:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-10-01 22:01:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-01 22:01:06,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:06,318 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:06,318 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:06,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:06,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1448030523, now seen corresponding path program 28 times [2019-10-01 22:01:06,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:06,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:06,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:06,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:06,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 22:01:06,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:06,906 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:06,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:07,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:07,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:07,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:01:07,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2019-10-01 22:01:07,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:07,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2019-10-01 22:01:07,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:01:07,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:01:07,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:01:07,394 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 41 states. [2019-10-01 22:01:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:07,577 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2019-10-01 22:01:07,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:01:07,578 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2019-10-01 22:01:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:07,579 INFO L225 Difference]: With dead ends: 167 [2019-10-01 22:01:07,579 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 22:01:07,583 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:01:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 22:01:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-10-01 22:01:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 22:01:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-10-01 22:01:07,593 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 154 [2019-10-01 22:01:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:07,593 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-10-01 22:01:07,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:01:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-10-01 22:01:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 22:01:07,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:07,594 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:07,595 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:07,595 INFO L82 PathProgramCache]: Analyzing trace with hash 921802629, now seen corresponding path program 29 times [2019-10-01 22:01:07,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:07,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:07,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:07,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:07,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-01 22:01:08,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:08,126 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:08,174 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:10,601 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 22:01:10,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:10,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:01:10,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2019-10-01 22:01:10,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:10,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2019-10-01 22:01:10,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:01:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:01:10,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:01:10,888 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 43 states. [2019-10-01 22:01:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:11,131 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2019-10-01 22:01:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:01:11,132 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2019-10-01 22:01:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:11,132 INFO L225 Difference]: With dead ends: 173 [2019-10-01 22:01:11,132 INFO L226 Difference]: Without dead ends: 123 [2019-10-01 22:01:11,133 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:01:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-01 22:01:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-10-01 22:01:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-01 22:01:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2019-10-01 22:01:11,139 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 162 [2019-10-01 22:01:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:11,139 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2019-10-01 22:01:11,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:01:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2019-10-01 22:01:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-01 22:01:11,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:11,141 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:11,141 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:11,141 INFO L82 PathProgramCache]: Analyzing trace with hash 301043269, now seen corresponding path program 30 times [2019-10-01 22:01:11,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:11,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:11,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:11,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:11,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-01 22:01:11,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:11,787 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:11,866 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:16,821 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:01:16,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:16,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:01:16,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1486 trivial. 0 not checked. [2019-10-01 22:01:17,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:17,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 11] total 43 [2019-10-01 22:01:17,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:01:17,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:01:17,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:01:17,117 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 43 states. [2019-10-01 22:01:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:17,365 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2019-10-01 22:01:17,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:01:17,366 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2019-10-01 22:01:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:17,367 INFO L225 Difference]: With dead ends: 179 [2019-10-01 22:01:17,367 INFO L226 Difference]: Without dead ends: 127 [2019-10-01 22:01:17,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:01:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-01 22:01:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-10-01 22:01:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 22:01:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 22:01:17,375 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 170 [2019-10-01 22:01:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:17,376 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 22:01:17,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:01:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 22:01:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 22:01:17,377 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:17,377 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:17,377 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:17,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1172060325, now seen corresponding path program 31 times [2019-10-01 22:01:17,378 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:17,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:17,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:18,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:18,076 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:18,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:18,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:01:18,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:18,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:18,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:01:18,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:01:18,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:01:18,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:01:18,240 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 22:01:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:18,356 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 22:01:18,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:01:18,360 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 22:01:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:18,361 INFO L225 Difference]: With dead ends: 182 [2019-10-01 22:01:18,362 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 22:01:18,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:01:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 22:01:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 22:01:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 22:01:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 22:01:18,368 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 22:01:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:18,368 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 22:01:18,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:01:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 22:01:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 22:01:18,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:18,370 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:18,370 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:18,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1616125561, now seen corresponding path program 32 times [2019-10-01 22:01:18,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:18,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:18,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:18,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:18,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:18,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:18,999 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:19,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:19,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:19,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:19,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:01:19,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:19,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:19,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 22:01:19,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 22:01:19,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 22:01:19,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:01:19,178 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 37 states. [2019-10-01 22:01:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:19,284 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2019-10-01 22:01:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 22:01:19,285 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2019-10-01 22:01:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:19,286 INFO L225 Difference]: With dead ends: 184 [2019-10-01 22:01:19,286 INFO L226 Difference]: Without dead ends: 130 [2019-10-01 22:01:19,287 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:01:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-01 22:01:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-10-01 22:01:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-01 22:01:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2019-10-01 22:01:19,295 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 176 [2019-10-01 22:01:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:19,296 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2019-10-01 22:01:19,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 22:01:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2019-10-01 22:01:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-01 22:01:19,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:19,298 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:19,298 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:19,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1003169303, now seen corresponding path program 33 times [2019-10-01 22:01:19,299 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:19,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:19,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:19,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:19,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:19,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:19,892 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:19,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:20,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 22:01:20,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:20,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:01:20,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 448 proven. 100 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2019-10-01 22:01:20,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:20,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 22:01:20,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:01:20,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:01:20,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:20,493 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 48 states. [2019-10-01 22:01:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:20,703 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2019-10-01 22:01:20,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:01:20,705 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2019-10-01 22:01:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:20,707 INFO L225 Difference]: With dead ends: 189 [2019-10-01 22:01:20,707 INFO L226 Difference]: Without dead ends: 135 [2019-10-01 22:01:20,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-01 22:01:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-10-01 22:01:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-01 22:01:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2019-10-01 22:01:20,715 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 178 [2019-10-01 22:01:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:20,718 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2019-10-01 22:01:20,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:01:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2019-10-01 22:01:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-01 22:01:20,719 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:20,719 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 33, 33, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:20,719 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash 457593001, now seen corresponding path program 34 times [2019-10-01 22:01:20,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:20,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:20,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:20,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:20,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2019-10-01 22:01:21,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:21,317 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:21,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:21,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:21,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:21,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:01:21,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 803 proven. 121 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-01 22:01:21,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:21,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 14] total 50 [2019-10-01 22:01:21,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 22:01:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 22:01:21,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:01:21,776 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 50 states. [2019-10-01 22:01:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:22,020 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2019-10-01 22:01:22,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 22:01:22,020 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2019-10-01 22:01:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:22,021 INFO L225 Difference]: With dead ends: 195 [2019-10-01 22:01:22,021 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 22:01:22,023 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:01:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 22:01:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-10-01 22:01:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-01 22:01:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-10-01 22:01:22,027 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 186 [2019-10-01 22:01:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:22,028 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-10-01 22:01:22,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 22:01:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-10-01 22:01:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-01 22:01:22,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:22,029 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:22,030 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1118472855, now seen corresponding path program 35 times [2019-10-01 22:01:22,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:22,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:22,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:22,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:22,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2019-10-01 22:01:22,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:22,898 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:22,957 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:55,539 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-01 22:01:55,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:55,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:01:55,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 628 proven. 144 refuted. 0 times theorem prover too weak. 1988 trivial. 0 not checked. [2019-10-01 22:01:56,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:56,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 52 [2019-10-01 22:01:56,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 22:01:56,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 22:01:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 22:01:56,006 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 52 states. [2019-10-01 22:01:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:56,254 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2019-10-01 22:01:56,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 22:01:56,255 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2019-10-01 22:01:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:56,257 INFO L225 Difference]: With dead ends: 201 [2019-10-01 22:01:56,257 INFO L226 Difference]: Without dead ends: 143 [2019-10-01 22:01:56,259 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 22:01:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-01 22:01:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-10-01 22:01:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-01 22:01:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2019-10-01 22:01:56,267 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 194 [2019-10-01 22:01:56,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:56,267 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2019-10-01 22:01:56,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 22:01:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2019-10-01 22:01:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 22:01:56,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:56,269 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 37, 37, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:56,270 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash 543770665, now seen corresponding path program 36 times [2019-10-01 22:01:56,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:56,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:56,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:56,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:56,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1695 trivial. 0 not checked. [2019-10-01 22:01:57,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:57,032 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:57,084 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:02:00,610 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-01 22:02:00,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:00,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:02:00,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 738 proven. 81 refuted. 0 times theorem prover too weak. 2245 trivial. 0 not checked. [2019-10-01 22:02:00,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:00,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 12] total 50 [2019-10-01 22:02:00,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 22:02:00,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 22:02:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:02:00,870 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 50 states. [2019-10-01 22:02:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:01,021 INFO L93 Difference]: Finished difference Result 207 states and 216 transitions. [2019-10-01 22:02:01,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 22:02:01,022 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 202 [2019-10-01 22:02:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:01,023 INFO L225 Difference]: With dead ends: 207 [2019-10-01 22:02:01,023 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 22:02:01,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:02:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 22:02:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-10-01 22:02:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 22:02:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 22:02:01,032 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 202 [2019-10-01 22:02:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:01,032 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 22:02:01,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 22:02:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 22:02:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-01 22:02:01,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:01,034 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:01,034 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1731487351, now seen corresponding path program 37 times [2019-10-01 22:02:01,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:01,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:01,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 22:02:01,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:01,987 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:02,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:02:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:02,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:02:02,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 22:02:02,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:02,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 22:02:02,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:02:02,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:02:02,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:02:02,183 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 22:02:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:02,317 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 22:02:02,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:02:02,317 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 206 [2019-10-01 22:02:02,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:02,318 INFO L225 Difference]: With dead ends: 210 [2019-10-01 22:02:02,318 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 22:02:02,319 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:02:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 22:02:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 22:02:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 22:02:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 22:02:02,324 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 206 [2019-10-01 22:02:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:02,325 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 22:02:02,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:02:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 22:02:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-01 22:02:02,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:02,326 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:02,327 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:02,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1569768853, now seen corresponding path program 38 times [2019-10-01 22:02:02,327 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:02,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:02,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:02,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:02:02,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 22:02:03,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:03,015 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:03,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:02:03,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:02:03,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:03,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 22:02:03,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:02:03,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:03,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 22:02:03,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:02:03,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:02:03,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:02:03,223 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 43 states. [2019-10-01 22:02:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:03,374 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2019-10-01 22:02:03,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:02:03,375 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 208 [2019-10-01 22:02:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:03,376 INFO L225 Difference]: With dead ends: 212 [2019-10-01 22:02:03,376 INFO L226 Difference]: Without dead ends: 150 [2019-10-01 22:02:03,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:02:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-01 22:02:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-10-01 22:02:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-01 22:02:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2019-10-01 22:02:03,383 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 208 [2019-10-01 22:02:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:03,383 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2019-10-01 22:02:03,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:02:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2019-10-01 22:02:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-01 22:02:03,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:03,385 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:03,385 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash -777114931, now seen corresponding path program 39 times [2019-10-01 22:02:03,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:03,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:03,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:03,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:03,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 22:02:04,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:04,169 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:04,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:02:04,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 22:02:04,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:04,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:02:04,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 738 proven. 100 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2019-10-01 22:02:04,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:04,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 13] total 54 [2019-10-01 22:02:04,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:02:04,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:02:04,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=980, Invalid=1882, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:02:04,783 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 54 states. [2019-10-01 22:02:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:05,061 INFO L93 Difference]: Finished difference Result 217 states and 226 transitions. [2019-10-01 22:02:05,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 22:02:05,065 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2019-10-01 22:02:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:05,066 INFO L225 Difference]: With dead ends: 217 [2019-10-01 22:02:05,066 INFO L226 Difference]: Without dead ends: 155 [2019-10-01 22:02:05,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=980, Invalid=1882, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:02:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-01 22:02:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2019-10-01 22:02:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 22:02:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 22:02:05,075 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 210 [2019-10-01 22:02:05,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:05,075 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 22:02:05,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:02:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 22:02:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 22:02:05,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:05,077 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:05,077 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:05,078 INFO L82 PathProgramCache]: Analyzing trace with hash -376184531, now seen corresponding path program 40 times [2019-10-01 22:02:05,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:05,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:05,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 22:02:06,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:06,081 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:06,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:02:06,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:02:06,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:06,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 22:02:06,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 22:02:06,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:06,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 22:02:06,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 22:02:06,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 22:02:06,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:02:06,282 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 45 states. [2019-10-01 22:02:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:06,464 INFO L93 Difference]: Finished difference Result 220 states and 228 transitions. [2019-10-01 22:02:06,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 22:02:06,465 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 214 [2019-10-01 22:02:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:06,467 INFO L225 Difference]: With dead ends: 220 [2019-10-01 22:02:06,467 INFO L226 Difference]: Without dead ends: 156 [2019-10-01 22:02:06,467 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:02:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-01 22:02:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-10-01 22:02:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-01 22:02:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2019-10-01 22:02:06,473 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 214 [2019-10-01 22:02:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:06,474 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2019-10-01 22:02:06,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 22:02:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2019-10-01 22:02:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-01 22:02:06,475 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:06,475 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:06,475 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1241612303, now seen corresponding path program 41 times [2019-10-01 22:02:06,476 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:06,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:06,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:06,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3499 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 22:02:07,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:07,463 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:07,527 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:03:30,219 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-01 22:03:30,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:30,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:03:30,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3499 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2598 trivial. 0 not checked. [2019-10-01 22:03:30,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:30,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 16] total 59 [2019-10-01 22:03:30,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 22:03:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 22:03:30,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:03:30,597 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 59 states. [2019-10-01 22:03:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:30,881 INFO L93 Difference]: Finished difference Result 225 states and 237 transitions. [2019-10-01 22:03:30,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 22:03:30,881 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 216 [2019-10-01 22:03:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:30,882 INFO L225 Difference]: With dead ends: 225 [2019-10-01 22:03:30,883 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 22:03:30,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:03:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 22:03:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2019-10-01 22:03:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-01 22:03:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2019-10-01 22:03:30,890 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 216 [2019-10-01 22:03:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:30,890 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2019-10-01 22:03:30,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 22:03:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2019-10-01 22:03:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-01 22:03:30,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:30,892 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:30,893 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 65185487, now seen corresponding path program 42 times [2019-10-01 22:03:30,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:30,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3833 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-10-01 22:03:31,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:31,725 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:31,793 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:03:33,476 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 22:03:33,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:33,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:03:33,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3833 backedges. 850 proven. 121 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:03:33,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:33,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 14] total 58 [2019-10-01 22:03:33,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 22:03:33,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 22:03:33,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1125, Invalid=2181, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:03:33,802 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand 58 states. [2019-10-01 22:03:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:34,068 INFO L93 Difference]: Finished difference Result 231 states and 240 transitions. [2019-10-01 22:03:34,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:03:34,072 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 224 [2019-10-01 22:03:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:34,074 INFO L225 Difference]: With dead ends: 231 [2019-10-01 22:03:34,074 INFO L226 Difference]: Without dead ends: 165 [2019-10-01 22:03:34,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1125, Invalid=2181, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:03:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-01 22:03:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2019-10-01 22:03:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 22:03:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 22:03:34,081 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 224 [2019-10-01 22:03:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:34,082 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 22:03:34,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 22:03:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 22:03:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 22:03:34,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:34,083 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:34,083 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:34,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1549752623, now seen corresponding path program 43 times [2019-10-01 22:03:34,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:34,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:34,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:34,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:34,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:35,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:35,053 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:35,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:03:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:35,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:03:35,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:35,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:35,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 22:03:35,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:03:35,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:03:35,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:03:35,281 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 22:03:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:35,406 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 22:03:35,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:03:35,407 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 22:03:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:35,408 INFO L225 Difference]: With dead ends: 234 [2019-10-01 22:03:35,408 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 22:03:35,409 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:03:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 22:03:35,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 22:03:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 22:03:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 22:03:35,414 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 22:03:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:35,415 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 22:03:35,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:03:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 22:03:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 22:03:35,416 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:35,417 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:35,417 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:35,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1185659759, now seen corresponding path program 44 times [2019-10-01 22:03:35,417 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:35,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:35,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:35,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:03:35,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:36,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:36,465 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:36,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:03:36,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:03:36,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:36,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 22:03:36,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:36,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:36,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-01 22:03:36,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 22:03:36,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 22:03:36,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:03:36,707 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 49 states. [2019-10-01 22:03:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:36,894 INFO L93 Difference]: Finished difference Result 236 states and 244 transitions. [2019-10-01 22:03:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:03:36,895 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 230 [2019-10-01 22:03:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:36,896 INFO L225 Difference]: With dead ends: 236 [2019-10-01 22:03:36,896 INFO L226 Difference]: Without dead ends: 168 [2019-10-01 22:03:36,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:03:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-01 22:03:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-10-01 22:03:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 22:03:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-10-01 22:03:36,903 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 230 [2019-10-01 22:03:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:36,903 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-10-01 22:03:36,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 22:03:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-10-01 22:03:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-01 22:03:36,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:36,905 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:36,905 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:36,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1396973709, now seen corresponding path program 45 times [2019-10-01 22:03:36,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:36,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:38,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:38,013 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:38,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:03:39,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 22:03:39,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:39,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:03:39,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 3129 trivial. 0 not checked. [2019-10-01 22:03:39,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:39,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 15] total 62 [2019-10-01 22:03:39,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:03:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:03:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=2502, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:03:39,795 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 62 states. [2019-10-01 22:03:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:40,108 INFO L93 Difference]: Finished difference Result 241 states and 250 transitions. [2019-10-01 22:03:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 22:03:40,109 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 232 [2019-10-01 22:03:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:40,110 INFO L225 Difference]: With dead ends: 241 [2019-10-01 22:03:40,110 INFO L226 Difference]: Without dead ends: 173 [2019-10-01 22:03:40,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1280, Invalid=2502, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:03:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-01 22:03:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-10-01 22:03:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 22:03:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 22:03:40,117 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 232 [2019-10-01 22:03:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:40,118 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 22:03:40,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:03:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 22:03:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 22:03:40,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:40,120 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:40,120 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:40,120 INFO L82 PathProgramCache]: Analyzing trace with hash 262928083, now seen corresponding path program 46 times [2019-10-01 22:03:40,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:40,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:40,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:40,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:40,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:03:41,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:41,262 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:41,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:03:41,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:03:41,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:41,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 22:03:41,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:03:41,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:41,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-01 22:03:41,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:03:41,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:03:41,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:03:41,505 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 51 states. [2019-10-01 22:03:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:41,676 INFO L93 Difference]: Finished difference Result 244 states and 252 transitions. [2019-10-01 22:03:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 22:03:41,676 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 236 [2019-10-01 22:03:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:41,678 INFO L225 Difference]: With dead ends: 244 [2019-10-01 22:03:41,678 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 22:03:41,679 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:03:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 22:03:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-01 22:03:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-01 22:03:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2019-10-01 22:03:41,685 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 236 [2019-10-01 22:03:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:41,685 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2019-10-01 22:03:41,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:03:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2019-10-01 22:03:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 22:03:41,688 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:41,688 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:41,689 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:41,689 INFO L82 PathProgramCache]: Analyzing trace with hash -860331979, now seen corresponding path program 47 times [2019-10-01 22:03:41,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:41,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:41,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:41,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:41,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:03:42,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:42,701 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:42,781 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:05:59,529 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-10-01 22:05:59,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:05:59,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:05:59,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:05:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3296 trivial. 0 not checked. [2019-10-01 22:05:59,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:05:59,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 17] total 66 [2019-10-01 22:05:59,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:05:59,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:05:59,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:05:59,997 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand 66 states. [2019-10-01 22:06:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:00,349 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2019-10-01 22:06:00,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:06:00,349 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 238 [2019-10-01 22:06:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:00,351 INFO L225 Difference]: With dead ends: 249 [2019-10-01 22:06:00,351 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 22:06:00,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:06:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 22:06:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-10-01 22:06:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-01 22:06:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-10-01 22:06:00,364 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 238 [2019-10-01 22:06:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:00,365 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-10-01 22:06:00,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:06:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-10-01 22:06:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-01 22:06:00,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:00,371 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 45, 45, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:00,371 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:00,372 INFO L82 PathProgramCache]: Analyzing trace with hash -465413387, now seen corresponding path program 48 times [2019-10-01 22:06:00,372 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:00,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:00,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:00,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 22:06:01,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:01,431 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:01,508 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:06:43,437 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 22:06:43,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:43,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:06:43,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 1067 proven. 169 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [2019-10-01 22:06:44,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:44,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 18] total 68 [2019-10-01 22:06:44,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 22:06:44,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 22:06:44,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=3006, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:06:44,152 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand 68 states. [2019-10-01 22:06:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:45,051 INFO L93 Difference]: Finished difference Result 256 states and 266 transitions. [2019-10-01 22:06:45,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-01 22:06:45,052 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 246 [2019-10-01 22:06:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:45,053 INFO L225 Difference]: With dead ends: 256 [2019-10-01 22:06:45,053 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 22:06:45,055 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1788, Invalid=4854, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:06:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 22:06:45,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 22:06:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 22:06:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 22:06:45,061 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 246 [2019-10-01 22:06:45,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:45,061 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 22:06:45,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 22:06:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 22:06:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 22:06:45,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:45,063 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:45,063 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:45,064 INFO L82 PathProgramCache]: Analyzing trace with hash 706249783, now seen corresponding path program 49 times [2019-10-01 22:06:45,064 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:45,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:45,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:46,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:46,186 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:46,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:06:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:46,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 22:06:46,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:06:46,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:46,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-01 22:06:46,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 22:06:46,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 22:06:46,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:06:46,442 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 55 states. [2019-10-01 22:06:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:46,665 INFO L93 Difference]: Finished difference Result 260 states and 268 transitions. [2019-10-01 22:06:46,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 22:06:46,666 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 252 [2019-10-01 22:06:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:46,667 INFO L225 Difference]: With dead ends: 260 [2019-10-01 22:06:46,667 INFO L226 Difference]: Without dead ends: 186 [2019-10-01 22:06:46,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:06:46,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-01 22:06:46,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-10-01 22:06:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-01 22:06:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2019-10-01 22:06:46,674 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 252 [2019-10-01 22:06:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:46,674 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2019-10-01 22:06:46,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 22:06:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2019-10-01 22:06:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-01 22:06:46,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:46,676 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:46,676 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:46,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash -600184423, now seen corresponding path program 50 times [2019-10-01 22:06:46,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:46,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:46,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:46,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:06:46,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:48,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:48,308 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:48,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:06:48,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:06:48,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:48,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 22:06:48,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:48,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:48,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 22:06:48,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 22:06:48,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 22:06:48,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:06:48,566 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 56 states. [2019-10-01 22:06:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:48,762 INFO L93 Difference]: Finished difference Result 262 states and 270 transitions. [2019-10-01 22:06:48,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 22:06:48,763 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 254 [2019-10-01 22:06:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:48,764 INFO L225 Difference]: With dead ends: 262 [2019-10-01 22:06:48,764 INFO L226 Difference]: Without dead ends: 188 [2019-10-01 22:06:48,765 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:06:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-01 22:06:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-10-01 22:06:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-01 22:06:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2019-10-01 22:06:48,771 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 254 [2019-10-01 22:06:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:48,771 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2019-10-01 22:06:48,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 22:06:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2019-10-01 22:06:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-01 22:06:48,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:48,773 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:48,774 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:48,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:48,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1953005957, now seen corresponding path program 51 times [2019-10-01 22:06:48,774 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:48,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:48,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:48,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:48,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5135 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:49,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:49,935 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:50,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:06:53,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:06:53,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:53,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:06:53,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5135 backedges. 1075 proven. 196 refuted. 0 times theorem prover too weak. 3864 trivial. 0 not checked. [2019-10-01 22:06:54,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:54,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 19] total 73 [2019-10-01 22:06:54,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 22:06:54,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 22:06:54,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1788, Invalid=3468, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:06:54,096 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 73 states. [2019-10-01 22:06:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:54,891 INFO L93 Difference]: Finished difference Result 268 states and 278 transitions. [2019-10-01 22:06:54,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 22:06:54,891 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 256 [2019-10-01 22:06:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:54,893 INFO L225 Difference]: With dead ends: 268 [2019-10-01 22:06:54,893 INFO L226 Difference]: Without dead ends: 194 [2019-10-01 22:06:54,894 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2058, Invalid=5598, Unknown=0, NotChecked=0, Total=7656 [2019-10-01 22:06:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-01 22:06:54,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-10-01 22:06:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-01 22:06:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 197 transitions. [2019-10-01 22:06:54,900 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 197 transitions. Word has length 256 [2019-10-01 22:06:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:54,900 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 197 transitions. [2019-10-01 22:06:54,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 22:06:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 197 transitions. [2019-10-01 22:06:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-01 22:06:54,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:54,902 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:54,903 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:54,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:54,903 INFO L82 PathProgramCache]: Analyzing trace with hash 188176701, now seen corresponding path program 52 times [2019-10-01 22:06:54,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:54,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:54,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:54,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:54,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 22:06:56,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:56,178 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:56,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:06:56,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:06:56,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:56,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 22:06:56,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (54)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:06:56,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:56,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-01 22:06:56,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 22:06:56,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 22:06:56,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:06:56,486 INFO L87 Difference]: Start difference. First operand 193 states and 197 transitions. Second operand 59 states. [2019-10-01 22:06:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:56,711 INFO L93 Difference]: Finished difference Result 272 states and 280 transitions. [2019-10-01 22:06:56,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:06:56,711 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 262 [2019-10-01 22:06:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:56,713 INFO L225 Difference]: With dead ends: 272 [2019-10-01 22:06:56,713 INFO L226 Difference]: Without dead ends: 196 [2019-10-01 22:06:56,714 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 262 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-10-01 22:06:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-01 22:06:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-10-01 22:06:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-01 22:06:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2019-10-01 22:06:56,720 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 262 [2019-10-01 22:06:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:56,720 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2019-10-01 22:06:56,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 22:06:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2019-10-01 22:06:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-01 22:06:56,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:56,723 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:56,723 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2111116257, now seen corresponding path program 53 times [2019-10-01 22:06:56,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:56,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:56,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5491 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 22:06:58,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:58,100 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:58,191 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:09:29,308 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2019-10-01 22:09:29,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:29,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:09:29,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5491 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 4302 trivial. 0 not checked. [2019-10-01 22:09:29,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:29,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 18] total 75 [2019-10-01 22:09:29,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-01 22:09:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-01 22:09:29,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1863, Invalid=3687, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 22:09:29,822 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 75 states. [2019-10-01 22:09:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:30,178 INFO L93 Difference]: Finished difference Result 277 states and 289 transitions. [2019-10-01 22:09:30,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-01 22:09:30,178 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 264 [2019-10-01 22:09:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:30,179 INFO L225 Difference]: With dead ends: 277 [2019-10-01 22:09:30,179 INFO L226 Difference]: Without dead ends: 201 [2019-10-01 22:09:30,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1863, Invalid=3687, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 22:09:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-01 22:09:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-10-01 22:09:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 22:09:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-10-01 22:09:30,187 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 264 [2019-10-01 22:09:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:30,187 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-10-01 22:09:30,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-01 22:09:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-10-01 22:09:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-01 22:09:30,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:30,189 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 48, 48, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:30,189 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:30,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:30,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694815, now seen corresponding path program 54 times [2019-10-01 22:09:30,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:30,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:30,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:30,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:30,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5889 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-10-01 22:09:31,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:31,712 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:31,810 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:09:43,533 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 22:09:43,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:43,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:09:43,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5889 backedges. 1098 proven. 225 refuted. 0 times theorem prover too weak. 4566 trivial. 0 not checked. [2019-10-01 22:09:44,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:44,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 18] total 76 [2019-10-01 22:09:44,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-01 22:09:44,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-01 22:09:44,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=3778, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 22:09:44,055 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 76 states. [2019-10-01 22:09:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:44,354 INFO L93 Difference]: Finished difference Result 283 states and 292 transitions. [2019-10-01 22:09:44,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-01 22:09:44,354 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 272 [2019-10-01 22:09:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:44,356 INFO L225 Difference]: With dead ends: 283 [2019-10-01 22:09:44,356 INFO L226 Difference]: Without dead ends: 205 [2019-10-01 22:09:44,358 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1922, Invalid=3778, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 22:09:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-01 22:09:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2019-10-01 22:09:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-01 22:09:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-10-01 22:09:44,364 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 272 [2019-10-01 22:09:44,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:44,364 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-10-01 22:09:44,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-01 22:09:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-10-01 22:09:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-01 22:09:44,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:44,366 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:44,366 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:44,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1227270463, now seen corresponding path program 55 times [2019-10-01 22:09:44,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:44,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:44,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:45,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:45,914 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:46,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:09:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:46,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 22:09:46,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:46,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:46,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-10-01 22:09:46,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:09:46,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:09:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:09:46,185 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 62 states. [2019-10-01 22:09:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:46,429 INFO L93 Difference]: Finished difference Result 286 states and 294 transitions. [2019-10-01 22:09:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 22:09:46,429 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 276 [2019-10-01 22:09:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:46,430 INFO L225 Difference]: With dead ends: 286 [2019-10-01 22:09:46,430 INFO L226 Difference]: Without dead ends: 206 [2019-10-01 22:09:46,431 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:09:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-01 22:09:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-10-01 22:09:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 22:09:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2019-10-01 22:09:46,437 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 276 [2019-10-01 22:09:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:46,437 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2019-10-01 22:09:46,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:09:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2019-10-01 22:09:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-01 22:09:46,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:46,453 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:46,454 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1859745631, now seen corresponding path program 56 times [2019-10-01 22:09:46,454 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:46,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:46,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:46,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:09:46,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6152 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:47,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:47,854 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:47,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:09:48,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:09:48,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:48,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-01 22:09:48,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6152 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:48,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:48,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-10-01 22:09:48,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-01 22:09:48,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-01 22:09:48,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 22:09:48,124 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 63 states. [2019-10-01 22:09:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:48,362 INFO L93 Difference]: Finished difference Result 288 states and 296 transitions. [2019-10-01 22:09:48,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 22:09:48,363 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 278 [2019-10-01 22:09:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:48,364 INFO L225 Difference]: With dead ends: 288 [2019-10-01 22:09:48,364 INFO L226 Difference]: Without dead ends: 208 [2019-10-01 22:09:48,365 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 22:09:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-01 22:09:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-10-01 22:09:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-01 22:09:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 211 transitions. [2019-10-01 22:09:48,371 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 211 transitions. Word has length 278 [2019-10-01 22:09:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:48,371 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 211 transitions. [2019-10-01 22:09:48,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-01 22:09:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 211 transitions. [2019-10-01 22:09:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-01 22:09:48,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:48,373 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:48,374 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:48,374 INFO L82 PathProgramCache]: Analyzing trace with hash -659810429, now seen corresponding path program 57 times [2019-10-01 22:09:48,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:48,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:48,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6271 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:49,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:49,808 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:49,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:09:51,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 22:09:51,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:51,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:09:51,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6271 backedges. 1096 proven. 256 refuted. 0 times theorem prover too weak. 4919 trivial. 0 not checked. [2019-10-01 22:09:52,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:52,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 19] total 80 [2019-10-01 22:09:52,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-01 22:09:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-01 22:09:52,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2123, Invalid=4197, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 22:09:52,480 INFO L87 Difference]: Start difference. First operand 207 states and 211 transitions. Second operand 80 states. [2019-10-01 22:09:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:52,785 INFO L93 Difference]: Finished difference Result 293 states and 305 transitions. [2019-10-01 22:09:52,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-01 22:09:52,785 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 280 [2019-10-01 22:09:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:52,787 INFO L225 Difference]: With dead ends: 293 [2019-10-01 22:09:52,787 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 22:09:52,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2123, Invalid=4197, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 22:09:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 22:09:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-01 22:09:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-01 22:09:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2019-10-01 22:09:52,794 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 280 [2019-10-01 22:09:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:52,794 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2019-10-01 22:09:52,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-01 22:09:52,795 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2019-10-01 22:09:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-01 22:09:52,796 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:52,796 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 51, 51, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:52,797 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:52,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:52,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2098044349, now seen corresponding path program 58 times [2019-10-01 22:09:52,797 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:52,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:52,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6695 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-10-01 22:09:54,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:54,583 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:54,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:09:54,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:09:54,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:54,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:09:54,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6695 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 5174 trivial. 0 not checked. [2019-10-01 22:09:55,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:55,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 20] total 82 [2019-10-01 22:09:55,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 22:09:55,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 22:09:55,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2205, Invalid=4437, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:09:55,407 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand 82 states. [2019-10-01 22:09:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:55,747 INFO L93 Difference]: Finished difference Result 299 states and 311 transitions. [2019-10-01 22:09:55,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 22:09:55,748 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 288 [2019-10-01 22:09:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:55,749 INFO L225 Difference]: With dead ends: 299 [2019-10-01 22:09:55,749 INFO L226 Difference]: Without dead ends: 217 [2019-10-01 22:09:55,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2205, Invalid=4437, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:09:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-01 22:09:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-10-01 22:09:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-01 22:09:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2019-10-01 22:09:55,757 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 288 [2019-10-01 22:09:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:55,758 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2019-10-01 22:09:55,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 22:09:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2019-10-01 22:09:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-01 22:09:55,760 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:55,760 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 54, 54, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:55,760 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1592665341, now seen corresponding path program 59 times [2019-10-01 22:09:55,761 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:55,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:55,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:55,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:55,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 3295 trivial. 0 not checked. [2019-10-01 22:09:57,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:57,315 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:57,427 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:13:11,669 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2019-10-01 22:13:11,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:13:11,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:13:11,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:13:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 5443 trivial. 0 not checked. [2019-10-01 22:13:12,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:13:12,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 21] total 84 [2019-10-01 22:13:12,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-10-01 22:13:12,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-10-01 22:13:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2289, Invalid=4683, Unknown=0, NotChecked=0, Total=6972 [2019-10-01 22:13:12,358 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 84 states. [2019-10-01 22:13:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:13:12,773 INFO L93 Difference]: Finished difference Result 305 states and 317 transitions. [2019-10-01 22:13:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-01 22:13:12,773 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 296 [2019-10-01 22:13:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:13:12,774 INFO L225 Difference]: With dead ends: 305 [2019-10-01 22:13:12,774 INFO L226 Difference]: Without dead ends: 221 [2019-10-01 22:13:12,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2289, Invalid=4683, Unknown=0, NotChecked=0, Total=6972 [2019-10-01 22:13:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-01 22:13:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2019-10-01 22:13:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-01 22:13:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2019-10-01 22:13:12,781 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 296 [2019-10-01 22:13:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:13:12,781 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2019-10-01 22:13:12,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-10-01 22:13:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2019-10-01 22:13:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-01 22:13:12,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:13:12,783 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 57, 57, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:13:12,784 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:13:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:13:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1594982851, now seen corresponding path program 60 times [2019-10-01 22:13:12,784 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:13:12,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:13:12,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:13:12,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:13:12,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:13:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:13:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7603 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3634 trivial. 0 not checked. [2019-10-01 22:13:14,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:13:14,351 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:13:14,465 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:14:30,366 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 22:14:30,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:30,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 22:14:30,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7603 backedges. 1655 proven. 256 refuted. 0 times theorem prover too weak. 5692 trivial. 0 not checked. [2019-10-01 22:14:31,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:31,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 21] total 85 [2019-10-01 22:14:31,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-01 22:14:31,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-01 22:14:31,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2448, Invalid=4692, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 22:14:31,064 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 85 states. [2019-10-01 22:14:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:32,133 INFO L93 Difference]: Finished difference Result 312 states and 322 transitions. [2019-10-01 22:14:32,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-01 22:14:32,133 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 304 [2019-10-01 22:14:32,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:32,135 INFO L225 Difference]: With dead ends: 312 [2019-10-01 22:14:32,135 INFO L226 Difference]: Without dead ends: 226 [2019-10-01 22:14:32,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2788, Invalid=7514, Unknown=0, NotChecked=0, Total=10302 [2019-10-01 22:14:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-01 22:14:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-10-01 22:14:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-01 22:14:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 229 transitions. [2019-10-01 22:14:32,142 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 229 transitions. Word has length 304 [2019-10-01 22:14:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:32,143 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 229 transitions. [2019-10-01 22:14:32,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-01 22:14:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2019-10-01 22:14:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-01 22:14:32,145 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:32,145 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:14:32,145 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:32,146 INFO L82 PathProgramCache]: Analyzing trace with hash -828722555, now seen corresponding path program 61 times [2019-10-01 22:14:32,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:32,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:32,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:32,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:14:34,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:34,000 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:14:34,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:14:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:34,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 67 conjunts are in the unsatisfiable core [2019-10-01 22:14:34,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:14:34,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:34,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 69 [2019-10-01 22:14:34,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-01 22:14:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-01 22:14:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 22:14:34,365 INFO L87 Difference]: Start difference. First operand 225 states and 229 transitions. Second operand 69 states. [2019-10-01 22:14:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:34,595 INFO L93 Difference]: Finished difference Result 316 states and 324 transitions. [2019-10-01 22:14:34,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-01 22:14:34,595 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 310 [2019-10-01 22:14:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:34,596 INFO L225 Difference]: With dead ends: 316 [2019-10-01 22:14:34,596 INFO L226 Difference]: Without dead ends: 228 [2019-10-01 22:14:34,597 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 22:14:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-01 22:14:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-10-01 22:14:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-01 22:14:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2019-10-01 22:14:34,603 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 310 [2019-10-01 22:14:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:34,603 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2019-10-01 22:14:34,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-01 22:14:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2019-10-01 22:14:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-01 22:14:34,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:34,605 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:14:34,606 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:34,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:34,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2065942169, now seen corresponding path program 62 times [2019-10-01 22:14:34,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:34,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:34,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:14:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8023 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:14:36,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:36,345 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:14:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:14:36,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:14:36,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:36,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 68 conjunts are in the unsatisfiable core [2019-10-01 22:14:36,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8023 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:14:36,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:36,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 70 [2019-10-01 22:14:36,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 22:14:36,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 22:14:36,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:14:36,661 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 70 states. [2019-10-01 22:14:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:36,899 INFO L93 Difference]: Finished difference Result 318 states and 326 transitions. [2019-10-01 22:14:36,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-01 22:14:36,900 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 312 [2019-10-01 22:14:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:36,901 INFO L225 Difference]: With dead ends: 318 [2019-10-01 22:14:36,901 INFO L226 Difference]: Without dead ends: 230 [2019-10-01 22:14:36,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:14:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-01 22:14:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-10-01 22:14:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-01 22:14:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2019-10-01 22:14:36,908 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 312 [2019-10-01 22:14:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:36,909 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2019-10-01 22:14:36,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 22:14:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2019-10-01 22:14:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-01 22:14:36,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:36,911 INFO L411 BasicCegarLoop]: trace histogram [67, 67, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:14:36,911 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:36,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1328050231, now seen corresponding path program 63 times [2019-10-01 22:14:36,912 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:36,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:36,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:36,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8156 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:14:38,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:38,701 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:14:38,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:14:40,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 22:14:40,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:40,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:14:40,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8156 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 6337 trivial. 0 not checked. [2019-10-01 22:14:41,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:41,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 20] total 88 [2019-10-01 22:14:41,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-10-01 22:14:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-10-01 22:14:41,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2604, Invalid=5052, Unknown=0, NotChecked=0, Total=7656 [2019-10-01 22:14:41,300 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand 88 states. [2019-10-01 22:14:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:41,681 INFO L93 Difference]: Finished difference Result 323 states and 332 transitions. [2019-10-01 22:14:41,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-01 22:14:41,681 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 314 [2019-10-01 22:14:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:41,682 INFO L225 Difference]: With dead ends: 323 [2019-10-01 22:14:41,682 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 22:14:41,683 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2604, Invalid=5052, Unknown=0, NotChecked=0, Total=7656 [2019-10-01 22:14:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 22:14:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-01 22:14:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-01 22:14:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 237 transitions. [2019-10-01 22:14:41,689 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 237 transitions. Word has length 314 [2019-10-01 22:14:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:41,689 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 237 transitions. [2019-10-01 22:14:41,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-10-01 22:14:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2019-10-01 22:14:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-10-01 22:14:41,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:41,691 INFO L411 BasicCegarLoop]: trace histogram [68, 68, 57, 57, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:14:41,691 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1379175721, now seen corresponding path program 64 times [2019-10-01 22:14:41,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:41,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:41,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8326 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-10-01 22:14:43,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:43,551 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:14:43,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:14:43,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:14:43,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:43,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:14:43,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8326 backedges. 1528 proven. 361 refuted. 0 times theorem prover too weak. 6437 trivial. 0 not checked. [2019-10-01 22:14:44,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:44,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 22] total 91 [2019-10-01 22:14:44,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-10-01 22:14:44,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-10-01 22:14:44,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2715, Invalid=5475, Unknown=0, NotChecked=0, Total=8190 [2019-10-01 22:14:44,602 INFO L87 Difference]: Start difference. First operand 233 states and 237 transitions. Second operand 91 states. [2019-10-01 22:14:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:44,994 INFO L93 Difference]: Finished difference Result 329 states and 341 transitions. [2019-10-01 22:14:44,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-01 22:14:44,995 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 318 [2019-10-01 22:14:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:44,996 INFO L225 Difference]: With dead ends: 329 [2019-10-01 22:14:44,996 INFO L226 Difference]: Without dead ends: 239 [2019-10-01 22:14:44,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2715, Invalid=5475, Unknown=0, NotChecked=0, Total=8190 [2019-10-01 22:14:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-01 22:14:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2019-10-01 22:14:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-01 22:14:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 241 transitions. [2019-10-01 22:14:45,004 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 241 transitions. Word has length 318 [2019-10-01 22:14:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:45,004 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 241 transitions. [2019-10-01 22:14:45,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-10-01 22:14:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 241 transitions. [2019-10-01 22:14:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-01 22:14:45,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:45,007 INFO L411 BasicCegarLoop]: trace histogram [69, 69, 60, 60, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:14:45,007 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:45,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2057140247, now seen corresponding path program 65 times [2019-10-01 22:14:45,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:45,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:45,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8820 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 4059 trivial. 0 not checked. [2019-10-01 22:14:46,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:46,874 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:14:47,005 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1